Question 120
Before a championship, each participating team proposes at most $t$ different colours for its jersey. A set $S$ of teams is called identifiable if one can assign to each team of $S$ a colour that appears in its set of proposals and appears in no colour set of another team. Denoting by $n$ the total number of different colours proposed, determine the largest integer $g(n, t)$ such that one can always find an identifiable set of teams of size at least $g(n, t)$.