« Vrati se
Define a k-clique to be a set of k people such that every pair of them are acquainted with each other. At a certain party, every pair of 3-cliques has at least one person in common, and there are no 5-cliques. Prove that there are two or fewer people at the party whose departure leaves no 3-clique remaining.

Slični zadaci

#NaslovOznakeRj.KvalitetaTežina
1861IMO Shortlist 1993 problem C40
1873IMO Shortlist 1993 problem N31
2071IMO Shortlist 2001 problem C114
2074IMO Shortlist 2001 problem C48
2075IMO Shortlist 2001 problem C56
2076IMO Shortlist 2001 problem C62