Tag Archives: Ilan Karpas

Frankl’s Conjecture for Large Families: Ilan Karpas’ Proof

Frankl’s conjecture asserts that a for every finite family of of finite sets that is closed under union, there is an element that belongs to at least half the sets in the family. We mentioned the problem in our very … Continue reading

Posted in Combinatorics, Mathematics over the Internet, Open problems | Tagged , , , | 11 Comments

Ilan Karpas: Frankl’s Conjecture for Large Families

Frankl’s conjecture Frankl’s conjecture is the following: Let be a finite family of finite subsets of which is closed under union, namely,  if then also . Then there exists an element which belongs to at least half the sets in . … Continue reading

Posted in Combinatorics, Open problems | Tagged , , , | 3 Comments