Formalizing Frankl's conjecture: FC-families

DOI10.1007/978-3-642-31374-5_17MaRDI QIDQ2907327zbMATH OpenOpenAlexFDO

Authors Filip Marić, Miodrag Živković, Bojan Vučković

Publication date 7 September 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Extremal set theory (05D05)

Abstract: The Frankl's conjecture, formulated in 1979. and still open, states that in every family of sets closed for unions there is an element contained in at least half of the sets. FC-families are families for which it is proved that every union-closed family containing them satisfies the Frankl's condition (e.g., in every union-closed family that contains a one-element set {a}, the element a is contained in at least half of the sets, so families of the form {a} are the simplest FC-families). FC-families play an important role in attacking the Frankl's conjecture, since they enable significant search space pruning. We present a formalization of the computer assisted approach for proving that a family is an FC-family. Proof-by-computation paradigm is used and the proof assistant Isabelle/HOL is used both to check mathematical content, and to perform (verified) combinatorial searches on which the proofs rely. FC-families known in the literature are confirmed, and a new FC-family is discovered.

Recommendations

• Families implying the Frankl conjecture
• Approximation of Frankl's conjecture in the complement family
• FC-families and improved bounds for Frankl's conjecture
• Cutting planes for families implying Frankl's conjecture
• An attempt at frankl’s conjecture

Cites work

• scientific article; zbMATH DE number 718666 (Why is no real title available?)
• scientific article; zbMATH DE number 2065940 (Why is no real title available?)
• An attempt at frankl’s conjecture
• Every Planar Map is Four Colorable
• FC-families and improved bounds for Frankl's conjecture
• Families implying the Frankl conjecture
• Flyspeck I: Tame Graphs
• Formal proof - the four color theorem
• Frankl's conjecture is true for lower semimodular lattices
• Isabelle/HOL. A proof assistant for higher-order logic
• Note on the union-closed sets conjecture
• Strong semimodular lattices and Frankl's conjecture
• The 11-element case of Frankl's conjecture
• The four-colour theorem
• Union-closed families

Cited in

(9)

• Formalising the Kruskal-Katona theorem in Lean
• Cutting planes for families implying Frankl's conjecture
• A proof of Frankl's conjecture on cross-union families
• New conjectures for union-closed families
• The union-closed sets conjecture for small families
• The journey of the union-closed sets conjecture
• On the union-closed sets conjecture
• Verifying Faradžev-Read Type Isomorph-Free Exhaustive Generation
• Francy -- an interactive discrete mathematics framework for GAP

Describes a project that uses

Uses Software

• Isabelle/HOL

This page was built for publication: Formalizing Frankl's conjecture: FC-families

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2907327)