Remarks on Frankl's conjecture

2016/03/03 by Francesco Marigo, Marigo, Francesco, Davide Schipani +1
Computer Science · Mathematics · #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #cs.DM #math.CO

paper · pdf · doi:10.48550/arxiv.1603.01215

arxiv created 2016/03/03 · arxiv updated 2016/03/04

Abstract

First a few reformulations of Frankl's conjecture are given, in terms of reduced families or matrices, or analogously in terms of lattices. These lead naturally to a stronger conjecture with a neat formulation which might be easier to attack than Frankl's. To this end we prove an inequality which might help in proving the stronger conjecture.

Related

• A Note on the Frankl Conjecture
• A Simple Proof for the Generalized Frankel Conjecture
• The 6-element case of S-Frankl conjecture (I)
• Formalizing Frankl's Conjecture: FC-families
• Two Stronger Versions of the Union-closed Sets Conjecture