olymmath

KMO 2010 Problem 7

    There are 20002000 people, and some of them have called each other. Two people can call each other at most 11 time. For any two groups of three people AA and BB which A∩B=∅A \cap B = \emptyset , there exist one person from each of AA and BB that haven't called each other. Prove that the number of two people called each other is less than 201000201000 .

    Dataset text AI-MO AoPS. 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 kr-kmo/2010/p7 · Tag PQFJ1BQN8B · Edit this page on GitHub · Keys: j next, k previous