MathDB
International competition SRMC 2004 P-4

Source:

September 7, 2010
group theoryabstract algebracombinatorics proposedcombinatorics

Problem Statement

Natural n≥2n \geq 2 is given. Group of people calls n−compactn-compact, if for any men from group, we can found nn people (without he), each two of there are familiar. Find maximum NN such that for any n−compactn-compact group, consisting NN people contains subgroup from n+1n+1 people, each of two of there are familiar.
Back to ProblemsView on AoPS