olymmath

KöMaL 2012 A558

    Prove that there exists a constant CC>0 for which the following statement holds: if nn is a positive integer and A1,A2,…,AN⊂{1,2,…,n}A_1,A_2,\ldots,A_N\subset\{1,2,\ldots,n\} are sets such that every two of them has at least two, and every three of them has at most three elements in common, then NN<Cn2Cn^2.

    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/2012/a558 · Tag BR10N1DZXG · Edit this page on GitHub · Keys: j next, k previous