CZ-SK-MO 1996 Problem 3
Given six three-element subsets of a finite set , show that it is possible to color the elements of in two colors so that none of the given subsets is in one color
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.