CombinatoricsDifficulty 6.0Prove itKöMaL problem A · Hungary · 2014
Let F be a finite family of finite sets and let A be an arbitrary finite set. We say that F shatters the set A if for every X⊆A there is a set F∈F such that A∩F=X. Show that F shatters at least ∣F∣ sets. (5 pont)
This one wants a proof. Work it on paper, then check yourself against the publisher's own solution, linked below. Be honest about it: the record is only any use to you if it is.
Source: KöMaL,
licensed Rights held by KöMaL and the MATFUND Foundation.
Statement reproduced verbatim; metadata (topic, difficulty, ordering) added by this project. Solutions are the publisher's, linked not copied.