« Vrati se
At a party attended by n married couples, each person talks to everyone else at the party except his or her spouse. The conversations involve sets of persons or cliques C_1, C_2, \cdots, C_k with the following property: no couple are members of the same clique, but for every other pair of persons there is exactly one clique to which both members belong. Prove that if n \geq 4, then k \geq 2n.

Proposed by USA.

Slični zadaci

#NaslovOznakeRj.KvalitetaTežina
1959IMO Shortlist 1997 problem 30
1798IMO Shortlist 1990 problem 280
1757IMO Shortlist 1989 problem 195
1718IMO Shortlist 1988 problem 110
1701IMO Shortlist 1987 problem 170
1698IMO Shortlist 1987 problem 141