olymmath

KöMaL 2010 B4233

    The three-element subsets of a seven-element set are coloured. If the intersection of two sets is empty then they have different colours. What is the minimum number of colours needed?

    Official text KöMaL. Quoted with source.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator hu-komal/2010/b4233 · Tag 701G0E3KA5 · Edit this page on GitHub · Keys: j next, k previous