FC-families, and improved bounds for Frankl's Conjecture

dc.creatorMorris, Robert
dc.date2007-02-13
dc.date.accessioned2026-07-07T07:46:39Z
dc.date.available2026-07-07T07:46:39Z
dc.descriptionA family of sets F is said to be union-closed if A \cup B is in F for every A and B in F. 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 most nine elements, extending a result of Gao and Yu. We also pose several open questions.
dc.description19 pgs, no figures
dc.identifierhttps://arxiv.org/abs/math/0702348
dc.identifierhttp://arxiv.org/abs/math/0702348
dc.identifierEuropean Journal of Combinatorics 27 (2006) 269-282
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/123896
dc.subjectCombinatorics
dc.titleFC-families, and improved bounds for Frankl's Conjecture
dc.typetext

Files

Collections