Sunflowers and L-intersecting families

DOI10.1016/J.AKCEJ.2019.02.005zbMATH Open1473.05301arXiv1601.04897OpenAlexW2963825466MaRDI QIDQ5154604FDOQ5154604

Authors: Gábor Hegedüs 

Publication date: 5 October 2021

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Abstract: Let $f(k,r,s)$ stand for the least number so that if $calF$ is an arbitrary $k$-uniform, $L$-intersecting set system, where $|L|=s$, and $calF$ has more than $f(k,r,s)$ elements, then $calF$ contains a sunflower with $r$ petals. We give an upper bound for $f(k,3,s)$. Let $g(k,r,ell)$ be the least number so that any $k$-uniform, $ell$-intersecting set system of more than $g(k,r,ell)$ sets contains a sunflower with $r$ petals. We give also an upper bound for $g(k,r,ell)$.

Full work available at URL: https://arxiv.org/abs/1601.04897

Recommendations

• Multicolour sunflowers
• Note on sunflowers
• Sunflowers in lattices
• Turán numbers of sunflowers
• Improved bounds for the sunflower lemma

zbMATH Keywords

extremal set theory\(L\)-intersecting families\(\varDelta\)-system

Mathematics Subject Classification ID

Extremal set theory (05D05)

Cites Work

• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Intersection theorems for systems of sets
• Intersection Theorems for Systems of Sets
• An intersection theorem for systems of sets
• Title not available (Why is that?)
• On t-designs
• Title not available (Why is that?)

Cited In (6)

• Intersecting families with sunflower shadows
• UPPER BOUNDS FOR SUNFLOWER-FREE SETS
• Sunflowers in lattices
• Sunflowers in set systems of bounded dimension
• Sunflowers of convex open sets
• On restricted intersections and the sunflower problem

This page was built for publication: Sunflowers and \(L\)-intersecting families

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