Multicolour Sunflowers
From MaRDI portal
Publication:4554777
DOI10.1017/S0963548318000160zbMath1402.05208arXiv1512.00525OpenAlexW4233788697WikidataQ129910893 ScholiaQ129910893MaRDI QIDQ4554777
Publication date: 9 November 2018
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.00525
Extremal set theory (05D05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Cites Work
- Unnamed Item
- On sunflowers and matrix multiplication
- An Erdős-Ko-Rado theorem for cross \(t\)-intersecting families
- Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small
- On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression
- Une propriété extremale des plans projectifs finis dans une classe de codes équidistants
- A theorem on equidistant codes
- The exact bound in the Erdős-Ko-Rado theorem for cross-intersecting families
- Intersecting and cross-intersecting families of labeled sets
- Combinatorial properties of systems of sets
- Multicoloured extremal problems
- Multicolour Turán problems
- On cross-intersecting families of sets
- The maximum sum and the maximum product of sizes of cross-intersecting families
- Specified intersections
- On r-Cross Intersecting Families of Sets
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Intersection Theorems for Systems of Sets
- Forbidden Intersections
- An Intersection Theorem for a Collection of Families of Subsets of a Finite Set
- UPPER BOUNDS FOR SUNFLOWER-FREE SETS
- Set Systems with Restricted Cross-Intersections and the Minimum Rank ofInclusion Matrices
- A new generalization of the Erdős-Ko-Rado theorem
This page was built for publication: Multicolour Sunflowers
