Unsolved problem in mathematics:

If any two sets in some finite family of sets have a union that also belongs to the family, must some element belong to at least half of the sets in the family?

In combinatorics, the **union-closed sets conjecture** is an elementary problem, posed by Péter Frankl in 1979 and still open. A family of sets is said to be *union-closed* if the union of any two sets from the family remains in the family. The conjecture states:

For every finite union-closed family of finite 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.

If *F* is a union-closed family of sets, the family of complement sets to sets in *F* is closed under intersection, and an element that belongs to at least half of the sets of *F* belongs to at most half of the complement sets. Thus, an equivalent form of the conjecture (the form in which it was originally stated) is that, for any intersection-closed family of sets that contains more than one set, there exists an element that belongs to at most half of the sets in the family.

Although stated above in terms of families of sets, Frankl's conjecture has also been formulated and studied as a question in lattice theory. A lattice is a partially ordered set in which for two elements *x* and *y* there is a unique greatest element less than or equal to both of them (the *meet* of *x* and *y*) and a unique least element greater than or equal to both of them (the *join* of *x* and *y*). The family of all subsets of a set *S*, ordered by set inclusion, forms a lattice in which the meet is represented by the set-theoretic intersection and the join is represented by the set-theoretic union; a lattice formed in this way is called a Boolean lattice.
The lattice-theoretic version of Frankl's conjecture is that in any finite lattice there exists an element *x* that is not the join of any two smaller elements, and such that the number of elements greater than or equal to *x* totals at most half the lattice, with equality only if the lattice is a Boolean lattice. As Abe (2000) shows, this statement about lattices is equivalent to the Frankl conjecture for union-closed sets: each lattice can be translated into a union-closed set family, and each union-closed set family can be translated into a lattice, such that the truth of the Frankl conjecture for the translated object implies the truth of the conjecture for the original object. This lattice-theoretic version of the conjecture is known to be true for several natural subclasses of lattices^{[1]} but remains open in the general case.

Another equivalent formulation of the union-closed sets conjecture uses graph theory. In an undirected graph, an independent set is a set of vertices no two of which are adjacent to each other; an independent set is maximal if it is not a subset of a larger independent set. In any graph, the "heavy" vertices that appear in more than half of the maximal independent sets must themselves form an independent set, so there always exists at least one non-heavy vertex, a vertex that appears in at most half of the maximal independent sets. The graph formulation of the union-closed sets conjecture states that every finite non-empty graph contains two adjacent non-heavy vertices. It is automatically true when the graph contains an odd cycle, because the independent set of all heavy vertices cannot cover all the edges of the cycle. Therefore, the more interesting case of the conjecture is for bipartite graphs, which have no odd cycles. Another equivalent formulation of the conjecture is that, in every bipartite graph, there exist two vertices, one on each side of the bipartition, such that each of these two vertices belongs to at most half of the graph's maximal independent sets. This conjecture is known to hold for chordal bipartite graphs, bipartite series–parallel graphs, and bipartite graphs of maximum degree three.^{[2]}

The conjecture has been proven for many special cases of union-closed set families. In particular, it is known to be true for

- families of at most 46 sets.
^{[3]} - families of sets whose union has at most 11 elements.
^{[4]} - families of sets in which the smallest set has one or two elements.
^{[5]} - families of at least subsets of an -element set, for some constant .
^{[6]}But this result is published only in arxiv.

Péter Frankl stated the conjecture, in terms of intersection-closed set families, in 1979, and so the conjecture is usually credited to him and sometimes called the **Frankl conjecture**. The earliest publication of the union-closed version of the conjecture appears to be by Duffus (1985).