# FC-families and improved bounds for Frankl's conjecture

@article{Morris2006FCfamiliesAI,
title={FC-families and improved bounds for Frankl's conjecture},
author={R. Morris},
journal={Eur. J. Comb.},
year={2006},
volume={27},
pages={269-282}
}
• R. Morris
• Published 2006
• Mathematics, Computer Science
• Eur. J. Comb.
A family of sets A is said to be union-closed if {A∪B : A, B ∈ A} ⊂ A. Frankl's conjecture states that given any finite union-closed family of sets, not all empty, there exists an element contained in at least half of the sets. Here we prove that the conjecture holds for families containing three 3-subsets of a 5-set, four 3-subsets of a 6-set, or eight 4-subsets of a 6-set, extending work of Poonen and Vaughan. As an application we prove the conjecture in the case that the largest set has at… Expand

#### Topics from this paper

The 6-element case of S-Frankl conjecture (I)
• Mathematics
• 2018
The union-closed sets conjecture (Frankl's conjecture) says that for any finite union-closed family of finite sets, other than the family consisting only of the empty set, there exists an elementExpand
A new generic class of Frankl’s families
• Mathematics
• 2013
Frankl’s conjecture states that in a family of sets closed by union F such that F 6= {∅}, there is an element that belongs to at least half of the sets of F. There are several partial results of thisExpand
On averaging Frankl's conjecture for large union-closed-sets
• G. Czédli
• Computer Science, Mathematics
• J. Comb. Theory, Ser. A
• 2009
The sum of the n-2s(a), for all a@?A, is shown to be non-positive and this stronger version does not hold for all union-closed families; however, it is conjecture that it holds for a much wider class of families than considered here. Expand
Formalizing Frankl's Conjecture: FC-Families
• Mathematics, Computer Science
• AISC/MKM/Calculemus
• 2012
A formalization of the computer assisted approach for proving that a family is an FC-family, where proof assistant Isabelle/HOL is used both to check mathematical content, and to perform (verified) combinatorial searches on which the proofs rely. Expand
New Conjectures for Union-Closed Families
• Mathematics, Computer Science
• Electron. J. Comb.
• 2016
It is shown that the optimal values the authors computed do not vary with $n, and special cases of the Frankl conjecture are proved, and new conjectures are proved that are not equivalent to it while still having wide-reaching implications if proven true. Expand Significant contribution to the Frankl's union-closed conjecture A celebrated unresolved conjecture of Peter Frankl states that every finite union-closed collection of sets (B), with non-empty universe, admits an abundant element. The best result in the literatureExpand Cutting planes for families implying Frankl's conjecture • Jonad Pulaj • Mathematics, Computer Science • Math. Comput. • 2020 A cutting-plane method is designed that computes the explicit weights which imply the existence conditions of Poonen’s Theorem and allows us to find a counterexample to a ten-year-old conjecture by R. Morris about the structure of generators for Non–FC-families. Expand Two Stronger Versions of the Union-closed Sets Conjecture • Mathematics • 2017 The union-closed sets conjecture (Frankl’s conjecture) says that for any finite unionclosed family of finite sets, other than the family consisting only of the empty set, there exists an element thatExpand Union-closed families of sets • Computer Science, Mathematics • J. Comb. Theory, Ser. A • 2013 The minimum average size of an element of a union-closed family consisting of m subsets of a ground set with n elements is determined precisely, verifying a conjecture of Czedli, Maroti and Schmidt (2009) [3]. Expand On the Scope of Averaging for Frankl’s Conjecture • Mathematics, Computer Science • Order • 2009 Let$\mathcal F$be a union-closed family of subsets of an m-element set A. Let$n=|{\mathcal F}|\ge 2$. For b ∈ A let w(b) denote the number of sets in$\mathcal F$containing b minus the number ofExpand #### References SHOWING 1-10 OF 13 REFERENCES Families Implying the Frankl Conjecture • T. Vaughan • Computer Science, Mathematics • Eur. J. Comb. • 2002 A union closed (UC) family A is a finite family of sets such that the union of any two sets in A is also in A so that for every union closed family A, there exists some x contained in at least half the members of A that satisfies the Frankl conjecture. Expand An Average Set Size Theorem • David Reimer • Computer Science, Mathematics • Combinatorics, Probability and Computing • 2003 It is proved that, if a collection of sets [Ascr ] is union-closed, then the average set size of A is at least$\frac{1}{2}\log_2 (\vert A}\vert)\$. Expand
Note on the Union-Closed Sets Conjecture
• Mathematics, Computer Science
• Ars Comb.
• 1998
Improved bounds for the union-closed sets conjecture
• Ars Comb., 29
• 1990
On Union-Closed Families, I
• Computer Science
• J. Comb. Theory, Ser. A
• 1999
Extremal Set Systems, Chapter 24 of the Handbook of Combinatorics
• 1995
Frankl in Extremal Set Systems, Chapter 24 of the Handbook of Combinatorics
• Frankl in Extremal Set Systems, Chapter 24 of the Handbook of Combinatorics
• 1995
Improved bounds for the union-closed sets conjecture, Ars Comb
• Improved bounds for the union-closed sets conjecture, Ars Comb
• 1990
525 of Graphs and Order
• 525 of Graphs and Order
• 1985