This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND:
OR:
NO:

Found problems: 1

2017 USA Team Selection Test, 1
Tags: graph theory , hypergraph , combinatorics
In a sports league, each team uses a set of at most $t$ signature colors. A set $S$ of teams is[i] color-identifiable[/i] if one can assign each team in $S$ one of their signature colors, such that no team in $S$ is assigned any signature color of a different team in $S$. For all positive integers $n$ and $t$, determine the maximum integer $g(n, t)$ such that: In any sports league with exactly $n$ distinct colors present over all teams, one can always find a color-identifiable set of size at least $g(n, t)$.