REVIEW 4 cited by
Improved bounds for the sunflower lemma
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
A sunflower with $r$ petals is a collection of $r$ sets so that the intersection of each pair is equal to the intersection of all of them. Erd\H{o}s and Rado proved the sunflower lemma: for any fixed $r$, any family of sets of size $w$, with at least about $w^w$ sets, must contain a sunflower with $r$ petals. The famous sunflower conjecture states that the bound on the number of sets can be improved to $c^w$ for some constant $c$. In this paper, we improve the bound to about $(\log w)^w$. In fact, we prove the result for a robust notion of sunflowers, for which the bound we obtain is sharp up to lower order terms.
Forward citations
Cited by 4 Pith papers
-
The Hajnal--Rothschild problem
For large n, every extremal family with no s+1 pairwise <t-intersecting k-sets is a union of s t-intersecting cliques, as predicted by the Ahlswede-Khachatrian analogy.
-
A complete $t$-intersection theorem for families of spanning trees
For n large and 2≤t≤n−2, every t-intersecting family of spanning trees of K_n has size at most c_{n,t} n^{n−2−t}, with equality exactly for the trivial family containing a balanced fixed forest.
-
Satisfying sequences for rainbow partite matchings
For k-partite hypergraphs, the paper proves near-optimal asymmetric size thresholds that force rainbow matchings and shows a truncated arithmetic progression is not always satisfying.
-
Delta-system method: a survey
A survey of the Delta-system (sunflower) method in extremal set theory, with proofs of key theorems and a broad literature review.
Discussion (0). Continue with ORCID to comment.