On averaging Frankl's conjecture for large union-closed-sets

DOI10.1016/j.jcta.2008.08.002zbMath1206.05099OpenAlexW2016273509WikidataQ123272808 ScholiaQ123272808MaRDI QIDQ1024372

Gábor Czédli

Publication date: 17 June 2009

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2008.08.002

zbMATH Keywords

latticeFrankl's conjectureunion-closed sets

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Extremal set theory (05D05)

Related Items

New conjectures for union-closed families ⋮ The union-closed sets conjecture almost holds for almost all random bipartite graphs ⋮ Frankl's conjecture for subgroup lattices ⋮ The journey of the union-closed sets conjecture ⋮ Unnamed Item ⋮ On the scope of averaging for Frankl's conjecture ⋮ How to derive finite semimodular lattices from distributive lattices? ⋮ The number of triangular islands on a triangular grid

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• FC-families and improved bounds for Frankl's conjecture
• Union-closed families
• Frankl's conjecture is true for modular lattices
• Families implying the Frankl conjecture
• Excess of a lattice
• Strong semimodular lattices and Frankl's conjecture
• Frankl's conjecture is true for lower semimodular lattices