MathNet 2015-part-03 — 191 problems (EN–VI) Question 23

We want to color the 3-element subsets of $\{1,2,3,4,5,6,7\}$ in such a way that if two of these subsets have no common element, then they have different colors. What is the minimum number of colors needed to achieve this?