2015
DOI: 10.1016/j.ejc.2014.08.030
|View full text |Cite
|
Sign up to set email alerts
|

The graph formulation of the union-closed sets conjecture

Abstract: International audienceThe 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 f… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
5

Relationship

1
4

Authors

Journals

citations
Cited by 9 publications
references
References 16 publications
0
0
0
Order By: Relevance