Question 6
Let $n\ge3$ be an integer and $A=\{1,2,\ldots,n\}$. Determine the largest $k$ such that, for every collection of $k$ three-element subsets of $A$, one can color every element of $A$ either blue or red (one color per element) so that none of the selected subsets has all three elements of the same color.