The Journey of the Union-Closed Sets Conjecture

@article{Bruhn2015TheJO,
  title={The Journey of the Union-Closed Sets Conjecture},
  author={Henning Bruhn and Oliver Schaudt},
  journal={Graphs and Combinatorics},
  year={2015},
  volume={31},
  pages={2043-2074}
}
We survey the state of the union-closed sets conjecture. 

Figures from this paper

Proof of Union- Closed Sets Conjecture
We prove Union- Closed sets conjecture.
On the Union-Closed Set Conjecture
We provide a simple proof for the union-closed sets conjecture, a long-standing open problem in set theory with immediate applications to graph theory, number theory, and order-theory.
A Stronger Version of the Union-closed Sets Conjecture
The union-closed sets conjecture (Frankl's conjecture) says that for any finite union-closed family of finite sets, other than the family consisting only of the empty set, there exists an elementExpand
An Asymptotic Version of Frankl’s Conjecture
TLDR
It is shown that the maximum average set size in complements of union-closed families over n elements is . Expand
A Note on the Frankl Conjecture
The Frankl conjecture (called also union-closed sets conjecture) is one of the famous unsolved conjectures in combinatorics of finite sets. In this short note, we introduce and to some extent justifyExpand
Two Stronger Versions of the Union-closed Sets Conjecture
The union-closed sets conjecture (Frankl’s conjecture) says that for any finite unionclosed family of finite sets, other than the family consisting only of the empty set, there exists an element thatExpand
The graph formulation of the union-closed sets conjecture
TLDR
The conjecture that in a finite non-trivial union-closed family of sets there has to be an element that belongs to at least half the sets is trivially true for non-bipartite graphs and it holds also for the classes of chordal bipartites graphs, subcubic bipartITE graphs, bipartite series-parallel graphs and bipartitioned circular interval graphs. Expand
Frankl's Conjecture for Subgroup Lattices
We show that the subgroup lattice of any finite group satisfies Frankl's Union-Closed Conjecture. We show the same for all lattices with a modular coatom, a family which includes all supersolvableExpand
An asymptotic version of the union-closed sets conjecture
We show that the biggest possible average set size in the complement $2^{\{1,2,\ldots, n\}} \setminus A$ of a union-closed family $A \subset 2^{\{1,2, \ldots, n\}}$ is $\tfrac{n+1}{2}$. With the sameExpand
Generation of Union-Closed Sets and Moore Families
TLDR
An algorithm to constructively enumerate non-isomorphic Union closed Sets and Moore sets is described and it seems unlikely that constructive enumeration for 8 or more elements will be possible in the foreseeable future. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 86 REFERENCES
Union-closed families of sets
Abstract 3e use a lower bound on the number of small sets in an ideal to show that for each union-closed family of n sets there exists an element which belongs to at least of them, provided n isExpand
Strong semimodular lattices and Frankl's conjecture
Abstract. In this paper, we show that Frankl's conjecture holds for strong semimodular lattices. The result is the first step to deal with the case of upper semimodular lattices.
AN ATTEMPT AT FRANKL'S CONJECTURE
In 1979 Frankl conjectured that in a finite union-closed family F of finite sets, F � {∅} there has to be an element that belongs to at least half of the sets inF .W e prove this when| F| 10.
Density of union-closed families
TLDR
Two theorems related to Frankl's conjecture about union-closed families are proved, which states how small the sum of degrees in an m -element set may be and the smallest densities of families generated by sets of equal size. Expand
A NOTE OF THE UNION-CLOSED SETS CONJECTURE
Let srf' — {A\,..., An) be a union-closed set. This note establishes a property which must be possessed by any smallest counterexample to the Union-Closed Sets Conjecture. Specifically, aExpand
The graph formulation of the union-closed sets conjecture
TLDR
The conjecture that in a finite non-trivial union-closed family of sets there has to be an element that belongs to at least half the sets is trivially true for non-bipartite graphs and it holds also for the classes of chordal bipartites graphs, subcubic bipartITE graphs, bipartite series-parallel graphs and bipartitioned circular interval graphs. Expand
Frankl's Conjecture Is True for Lower Semimodular Lattices
  • J. Reinhold
  • Mathematics, Computer Science
  • Graphs Comb.
  • 2000
Abstract. It is shown that every finite lower semimodular lattice L with |L|≥2 contains a join-irreducible element x such that at most |L|/2 elements y∈L satisfy y≥x.
Frankl's Conjecture is True for Modular Lattices
Abstract. It is shown that every finite modular lattice L with |L|≥2 contains a join-irreducible element x∈L such that at most |L|/2 elements y∈L satisfy y≥x.
An Average Set Size Theorem
  • David Reimer
  • Computer Science, Mathematics
  • Combinatorics, Probability and Computing
  • 2003
TLDR
It is proved that, if a collection of sets [Ascr ] is union-closed, then the average set size of A is at least $\frac{1}{2}\log_2 (\vert A}\vert)$. Expand
A new short proof for the Kruskal-Katona theorem
  • P. Frankl
  • Mathematics, Computer Science
  • Discret. Math.
  • 1984
We give a very short proof for the Kruskal-Katona theorem and Lovasz's version of it: given xkk-element sets there are at least xk - 1 (k - 1)-element sets which are contained in at least one of theExpand
...
1
2
3
4
5
...