KöMaL 2008 A455
Let be a set with elements and let each of the families and consist of subsets of such that these 2 subsets are pairwise distinct. Suppose that for every and , the sets and have at least one common element. Show that .
Official text KöMaL. 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.