olymmath

KöMaL 2006 A399

    Given nn 3-element subset of a certain set SS. Prove that if nn=6 then the elements of SScan be colored with two colors such that each subset contains both colors. Is the same true for nn=7?

    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/2006/a399 · Tag SM3SKWENCE · Edit this page on GitHub · Keys: j next, k previous