Formalizing Frankl’s Conjecture: FC-Families
From MaRDI portal
Publication:2907327
DOI10.1007/978-3-642-31374-5_17zbMath1360.68758arXiv1207.3604OpenAlexW1502009249MaRDI QIDQ2907327
Filip Marić, Bojan Vučković, Miodrag Živković
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
Related Items
Verifying Faradžev-Read Type Isomorph-Free Exhaustive Generation, New conjectures for union-closed families, The union-closed sets conjecture for small families, On the union-closed sets conjecture, The journey of the union-closed sets conjecture, Formalising the Kruskal-Katona theorem in Lean, Cutting planes for families implying Frankl’s conjecture
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- FC-families and improved bounds for Frankl's conjecture
- The 11-element case of Frankl's conjecture
- Union-closed families
- The four-colour theorem
- Isabelle/HOL. A proof assistant for higher-order logic
- Families implying the Frankl conjecture
- Strong semimodular lattices and Frankl's conjecture
- Frankl's conjecture is true for lower semimodular lattices
- An attempt at frankl’s conjecture
- Flyspeck I: Tame Graphs
- Every Planar Map is Four Colorable