ISL 2002 C5
Let be a fixed positive integer, and let be an infinite family of sets, each of size , no two of which are disjoint. Prove that there exists a set of size that meets each set in .
Attachments:
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.