Improved bounds for the sunflower lemma
From MaRDI portal
Publication:5144949
DOI10.1145/3357713.3384234OpenAlexW2978665793MaRDI QIDQ5144949
Shachar Lovett, Ryan Alweiss, Kewen Wu, Jiapeng Zhang
Publication date: 19 January 2021
Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1908.08483
Related Items (17)
Partitioning permutations into monotone subsequences ⋮ Subgraph densities in a surface ⋮ Tree densities in sparse graph classes ⋮ Sunflowers: from soil to oil ⋮ Pseudo sunflowers ⋮ THE IONESCU–WAINGER MULTIPLIER THEOREM AND THE ADELES ⋮ Graphs of bounded depth‐2 rank‐brittleness ⋮ On t-Intersecting Hypergraphs with Minimum Positive Codegrees ⋮ On the size of shadow-added intersecting families ⋮ Thresholds versus fractional expectation-thresholds ⋮ Unavoidable hypergraphs ⋮ Note on sunflowers ⋮ Improved bounds for the sunflower lemma ⋮ On the hat guessing number of graphs ⋮ Maximum Size Intersecting Families of Bounded Minimum Positive Co-degree ⋮ Monotone circuit lower bounds from robust sunflowers ⋮ Hitting times for Shamir’s problem
This page was built for publication: Improved bounds for the sunflower lemma
