The union-closed sets conjecture almost holds for almost all random bipartite graphs

DOI10.1016/j.ejc.2016.06.006zbMath1348.05187OpenAlexW107440705WikidataQ123150785 ScholiaQ123150785MaRDI QIDQ326659

Henning Bruhn, Oliver Schaudt

Publication date: 12 October 2016

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2016.06.006

zbMATH Keywords

union-closed sets conjecture

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Related Items (2)

Unnamed Item ⋮ Generation of Union Closed Sets and Moore families

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The graph formulation of the union-closed sets conjecture
• FC-families and improved bounds for Frankl's conjecture
• The 11-element case of Frankl's conjecture
• On the scope of averaging for Frankl's conjecture
• On averaging Frankl's conjecture for large union-closed-sets
• Union-closed families
• Families implying the Frankl conjecture
• Frankl's conjecture is true for lower semimodular lattices
• Paths in graphs
• An Average Set Size Theorem
• Probability Inequalities for Sums of Bounded Random Variables
• Probability and Computing
• Union-closed families of sets

This page was built for publication: The union-closed sets conjecture almost holds for almost all random bipartite graphs