Lower bounds for the Turán densities of daisies
From MaRDI portal
Publication:6197308
DOI10.37236/11206arXiv2204.08930OpenAlexW4387402743MaRDI QIDQ6197308
No author found.
Publication date: 16 February 2024
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2204.08930
Hypergraphs (05C65) Extremal set theory (05D05) Additive bases, including sumsets (11B13) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Cites Work
- Vertex Turán problems in the hypercube
- On sets free of sumsets with summands of prescribed size
- An improved construction of progression-free sets
- A Note on Elkin’s Improvement of Behrend’s Construction
- Daisies and Other Turán Problems
- Extremal Problems for Affine Cubes of Integers
- Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs
- Probability and Computing
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
This page was built for publication: Lower bounds for the Turán densities of daisies
