Sunflowers in lattices

MaRDI QIDQ2583667zbMATH OpenFDO

Authors Geoffrey McKenna

Publication date 17 January 2006

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/128082, http://www.emis.de/journals/EJC/Volume_12/Abstracts/v12i1r66.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

distributive latticegeometric latticelatticematroidsunflower lemma

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Combinatorics of partially ordered sets (06A07)

Review text

This paper gives some generalizations of the Erdős sunflower lemma. A sunflower is a family of subsets so that the intersection of any two subsets is equal to the intersection of all subsets. The sunflower lemma says that if the family is \(k\)-uniform, and contains at least \(k!(t-1)^k\) subsets, then it contains a sunflower of size \(t\). The author generalizes the concept of sunflowers to any lattice, with meet replacing intersection. Then he gives generalizations in distributive lattices, graphic matroids, and matroids that are representable over a finite field. He also gives examples to show that it cannot be generalized further to all lattices or all matroids.

Recommendations

• Improved bounds for the sunflower lemma
• Sunflowers: from soil to oil
• Multicolour sunflowers
• Turán numbers of sunflowers
• Sunflowers and L-intersecting families

Cited in

(7)

• Improved bounds for the sunflower lemma
• Pseudo sunflowers
• Intersecting families with sunflower shadows
• Multicolour sunflowers
• Sunflowers: from soil to oil
• Sunflowers and L-intersecting families
• Sunflower hard disk graphs

This page was built for publication: Sunflowers in lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583667)