The graph formulation of the union-closed sets conjecture
From MaRDI portal
Publication:458600
DOI10.1016/j.ejc.2014.08.030zbMath1301.05183arXiv1212.4175OpenAlexW2059461644WikidataQ123153686 ScholiaQ123153686MaRDI QIDQ458600
Jan Arne Telle, Oliver Schaudt, Henning Bruhn, Pierre Charbit
Publication date: 8 October 2014
Published in: European Journal of Combinatorics, The Seventh European Conference on Combinatorics, Graph Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1212.4175
Extremal problems in graph theory (05C35) Extremal set theory (05D05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (9)
Approximately counting locally-optimal structures ⋮ Union Closed Tree Convex Sets ⋮ New conjectures for union-closed families ⋮ The union-closed sets conjecture almost holds for almost all random bipartite graphs ⋮ The journey of the union-closed sets conjecture ⋮ Union-closed sets and Horn Boolean functions ⋮ Extremal union-closed set families ⋮ Cutting planes for families implying Frankl’s conjecture ⋮ An Asymptotic Version of Frankl’s Conjecture
Cites Work
- Maximal independent sets in bipartite graphs obtained from Boolean lattices
- Claw-free graphs. III: Circular interval graphs
- The 11-element case of Frankl's conjecture
- Union-closed families
- Frankl's conjecture is true for lower semimodular lattices
- Counting maximal antichains and independent sets
- Upper Bounds on Boolean-Width with Applications to Exact Algorithms
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- An attempt at frankl’s conjecture
- Perfect Elimination and Chordal Bipartite Graphs
- A graph-theoretic version of the union-closed sets conjecture
- On conjectures of Frankl and El‐Zahar
- The union-closed sets conjecture almost holds for almost all random bipartite graphs
- Bicliques in graphs. I: Bounds on their number
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The graph formulation of the union-closed sets conjecture
