RO-TST 1999 Problem 16
Let be a set with elements, and let , , ..., be subsets of such that:
- for every ;
- for all such that .
Prove that there exists a subset of such that has at least elements, and for every , the set does not contain .
Alternative formulation. Let be a finite set with elements and be three-elements subsets of , such that , for every . Prove that there exists with , such that none of 's is a subset of .
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.