The graph formulation of the union-closed sets conjecture

Henning Bruhn (1) , Pierre Charbit (2) , Oliver Schaudt (3) , Jan Arne Telle (4)

1 Universität Ulm - Ulm University [Ulm, Allemagne]
2 GANG - Networks, Graphs and Algorithms
3 C&O - Equipe combinatoire et optimisation
4 UiB - Department of Informatics [Bergen]

The union-closed sets conjecture asserts 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. We show that this is equivalent to the conjecture that in a finite non-trivial graph there are two adjacent vertices each belonging to at most half of the maximal stable sets. In this graph formulation other special cases become natural. The conjecture is trivially true for non-bipartite graphs and we show that it holds also for the classes of chordal bipartite graphs, subcubic bipartite graphs, bipartite series-parallel graphs and bipartitioned circular interval graphs. We derive that the union-closed sets conjecture holds for all union-closed families being the union-closure of sets of size at most three.

Domaines: Mathématique discrète [cs.DM]; Algorithme et structure de données [cs.DS]; Combinatoire [math.CO]

Henning Bruhn, Pierre Charbit, Oliver Schaudt, Jan Arne Telle. The graph formulation of the union-closed sets conjecture. European Journal of Combinatorics, 2015, 43, pp.210-219. ⟨10.1016/j.ejc.2014.08.030⟩. ⟨hal-01253152⟩