Problem A. 399. (April 2006)
A. 399. Given n 3-element subset of a certain set S. Prove that if n=6 then the elements of S can be colored with two colors such that each subset contains both colors. Is the same true for n=7?
Deadline expired on 18 May 2006.