Near-sunflowers and focal families

DOI10.1007/s11856-023-2500-1zbMath1525.05182arXiv2010.05992OpenAlexW3092758917MaRDI QIDQ6076184

Noga Alon, Ron Holzman

Publication date: 23 October 2023

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Erdős-Rado sunflower conjecturesunflowers in families of sets

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression
• Families of finite sets in which no set is covered by the union of two others
• Combinatorial properties of systems of sets
• Intersection statements for systems of sets
• An improved upper bound for the size of a sunflower-free family
• On the extremal combinatorics of the Hamming space
• Improved bounds for the sunflower lemma
• String Quartets in Binary
• Separating Partition Systems and Locally Different Sequences
• Intersection Theorems for Systems of Sets
• New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
• Frameproof Codes
• New rate pairs in the zero-error capacity region of the binary multiplying channel without feedback
• UPPER BOUNDS FOR SUNFLOWER-FREE SETS
• Determination of two vectors from the sum

This page was built for publication: Near-sunflowers and focal families