Problem

Source: 2013 Romania JBMO TST 2.3

Tags: Coloring, combinatorics



The three-element subsets of a seven-element set are colored. If the intersection of two sets is empty then they have different colors. What is the minimum number of colors needed?