Skip to main content

Formalizing Frankl’s Conjecture: FC-Families

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNAI,volume 7362)

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.

Keywords

  • Weight Function
  • Java Program
  • Proof Assistant
  • Semimodular Lattice
  • Combinatorial Search

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abe, T.: Strong Semimodular Lattices and Frankl’s Conjecture. Algebra Universalis 44, 379–382 (2000)

    CrossRef  MathSciNet  MATH  Google Scholar 

  2. Appel, K.I., Haken, W.: Every Planar Map is Four Colorable. American Mathematical Society (1989)

    Google Scholar 

  3. Bošnjak, I., Marković, P.: The 11-element Case of Frankl’s Conjecture. Electronic Journal of Combinatorics 15(1) (2008)

    Google Scholar 

  4. Faro, G.L.: Union-closed Sets Conjecture: Improved Bounds. J. Combin. Math. Combin. Comput. 16, 97–102 (1994)

    MathSciNet  MATH  Google Scholar 

  5. Gao, W., Yu, H.: Note on the Union-Closed Sets Conjecture. Ars Combinatorica 49 (1998)

    Google Scholar 

  6. Gonthier, G.: Formal Proof – the Four-Color Theorem. Notices of AMS 55(11) (2008)

    Google Scholar 

  7. Marković, P.: An attempt at Frankl’s Conjecture. Publications de l’Institut Mathmatique 81(95), 29–43 (2007)

    CrossRef  Google Scholar 

  8. Morris, R.: FC-families and Improved Bounds for Frankls Conjecture. European Journal of Combinatorics 27(2), 269–282 (2006)

    CrossRef  MathSciNet  MATH  Google Scholar 

  9. Nipkow, T., Bauer, G., Schultz, P.: Flyspeck I: Tame Graphs. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 21–35. Springer, Heidelberg (2006)

    CrossRef  Google Scholar 

  10. Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle/HOL — A Proof Assistant for Higher-Order Logic. LNCS, vol. 2283. Springer, Heidelberg (2002)

    MATH  Google Scholar 

  11. Poonen, B.: Union-closed Families. Journal of Combinatorial Theory, Series A 59(2), 253–268 (1992)

    CrossRef  MathSciNet  MATH  Google Scholar 

  12. Reinhold, J.: Frankl’s Conjecture is True for Lower Semimodular Lattices. Graphs and Combinatorics 16, 115–116 (2000)

    CrossRef  MathSciNet  MATH  Google Scholar 

  13. Robertson, N., Sanders, D.P., Seymour, P.D., Thomas, R.: The Four Colour Theorem. Journal of Combinatorial Theory, Series B (1997)

    Google Scholar 

  14. Vaughan, T.P.: Families Implying the Frankl Conjecture. European Journal of Combinatorics 23(7), 851–860 (2002)

    CrossRef  MathSciNet  MATH  Google Scholar 

  15. Vaughan, T.P.: A Note on the Union-closed Sets Conjecture. J. Combin. Math. Combin. Comput. 45, 95–108 (2003)

    MathSciNet  MATH  Google Scholar 

  16. Vaughan, T.P.: Three-sets in a Union-closed Family. J. Combin. Math. Combin. Comput. 49, 95–108 (2004)

    MathSciNet  Google Scholar 

  17. Živković, M., Vučković, B.: The 12-element Case of Frankls Conjecture (submitted, 2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Marić, F., Živković, M., Vučković, B. (2012). Formalizing Frankl’s Conjecture: FC-Families. In: Jeuring, J., et al. Intelligent Computer Mathematics. CICM 2012. Lecture Notes in Computer Science(), vol 7362. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31374-5_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31374-5_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31373-8

  • Online ISBN: 978-3-642-31374-5

  • eBook Packages: Computer ScienceComputer Science (R0)