Problem

Source: 2016 Saudi Arabia BMO TST , level 4+, III p4

Tags: Coloring, combinatorics



Given six three-element subsets of the set $X$ with at least $5$ elements, show that it is possible to color the elements of $X$ in two colors such that none of the given subsets is all in one color.