Union-closed sets conjecture

The union-closed sets conjecture, also known as Frankl’s conjecture, is an open problem in combinatorics posed by Péter Frankl in 1979. A family of sets is said to be union-closed if the union of any two sets from the family belongs to the family. The conjecture states: For every finite union-closed family of sets, other than the family containing only the empty set, there exists an element that belongs to at least half of the sets in the family. Professor Timothy Gowers has called this "one of the best known open problems in combinatorics" and has said that the conjecture "feels as though it ought to be easy (and as a result has attracted a lot of false proofs over the years). A good way to understand why it isn't easy is to spend an afternoon trying to prove it. That clever averaging argument you had in mind doesn't work ..." Example The family of setsconsists of five different sets and is union-closed. The element is contained in three of the five sets (and so is the element ), thus the conjecture holds in this case. Basic results It is easy to show that if a union-closed family contains a singleton (as in the example above), then the element must occur in at least half of the sets of the family.