New conjectures for union-closed families

zbMath1412.05193arXiv1512.00083MaRDI QIDQ311524

Annie Raymond, Jonad Pulaj, Dirk Oliver Theis

Publication date: 13 September 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1512.00083

zbMATH Keywords

integer programmingFrankl conjectureunion-closed families

Mathematics Subject Classification ID

Integer programming (90C10) Extremal set theory (05D05)

Related Items

Characterizing 3-Sets in Union-Closed Families ⋮ Unnamed Item ⋮ Cutting planes for families implying Frankl’s conjecture ⋮ Well-graded families and the union-closed sets conjecture

Cites Work

• The graph formulation of the union-closed sets conjecture
• Minimal weight in union-closed families
• FC-families and improved bounds for Frankl's conjecture
• The journey of the union-closed sets 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
• Frankl's conjecture is true for modular lattices
• On the trace of finite sets
• Families implying the Frankl conjecture
• Strong semimodular lattices and Frankl's conjecture
• Lower semimodular types of lattices: Frankl's conjecture holds for lower quasi-semimodular lattices
• Frankl's conjecture is true for lower semimodular lattices
• Formalizing Frankl’s Conjecture: FC-Families
• A graph-theoretic version of the union-closed sets conjecture
• An Average Set Size Theorem
• On union-closed sets and Conway's sequence
• A Stability Result for the Union-Closed Size Problem
• On conjectures of Frankl and El‐Zahar
• The union-closed sets conjecture almost holds for almost all random bipartite graphs
• Union-closed families of sets
• On union-closed families. I
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item