Mathematical and Physical Journal
for High Schools
Issued by the MATFUND Foundation
Already signed up?
New to KöMaL?
I want the old design back!!! :-)

Problem A. 370. (March 2005)

A. 370. For any two guests on a party of kn participants there is some guest who knows both of them. Prove that if k<\frac{n}{2\ln n} then one can find n guests who together know everyone else.

(5 pont)

Deadline expired on April 15, 2005.


Statistics:

3 students sent a solution.
5 points:Jankó Zsuzsanna, Paulin Roland.
4 points:Strenner Balázs.

Problems in Mathematics of KöMaL, March 2005