Improved bounds for the sunflower lemma

DOI10.4007/annals.2021.194.3.5zbMath1479.05343arXiv1908.08483OpenAlexW3212605836WikidataQ124982983 ScholiaQ124982983MaRDI QIDQ2058613

Ryan Alweiss, Shachar Lovett, Jiapeng Zhang, Kewen Wu

Publication date: 9 December 2021

Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)

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

zbMATH Keywords

disjunctive normal formspreadset systemssunflowers

Mathematics Subject Classification ID

Extremal set theory (05D05) Ramsey theory (05D10) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (12)

Turán numbers of sunflowers ⋮ Combinatorics. Abstracts from the workshop held January 1--7, 2023 ⋮ A proof of the Kahn–Kalai conjecture ⋮ Hypercontractivity for global functions and sharp thresholds ⋮ Near-sunflowers and focal families ⋮ Rainbow independent sets in certain classes of graphs ⋮ On restricted intersections and the sunflower problem ⋮ The Park-Pham theorem with optimal convergence rate ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ Threshold for Steiner triple systems ⋮ Rainbow powers of a Hamilton cycle in G_n,p ⋮ Defective coloring of hypergraphs

Cites Work

• A nowhere-zero point in linear mappings
• Every large set of equidistant (0,+1,-1)-vectors forms a sunflower
• Combinatorial properties of systems of sets
• The permanent rank of a matrix
• Thresholds versus fractional expectation-thresholds
• Note on sunflowers
• Intersection Theorems for Systems of Sets
• Coding for Sunflowers
• Improved bounds for the sunflower lemma
• UPPER BOUNDS FOR SUNFLOWER-FREE SETS
• The Monotone Complexity of $k$-Clique on Random Graphs
• Monotone circuit lower bounds from robust sunflowers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Improved bounds for the sunflower lemma