Independent sets in algebraic hypergraphs
DOI10.4171/JEMS/1082zbMath1485.05120arXiv1809.05205MaRDI QIDQ2119362
Anton Bernshteyn, Anush Tserunyan, Michelle Delcourt
Publication date: 29 March 2022
Published in: Journal of the European Mathematical Society (JEMS) (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.05205
independent setrational parameterizationtransference principlealgebraic hypergraphdimension of fiberscontainers methodfiberwise definability
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Varieties and morphisms (14A10) Infinite graphs (05C63) Elementary questions in algebraic geometry (14A25)
Cites Work
- Unnamed Item
- Extremal results for random discrete structures
- Combinatorial theorems in sparse random sets
- Hypergraph containers
- Bounds in the theory of polynomial rings over fields. A nonstandard approach
- Semi-algebraic Ramsey numbers
- On the number of graphs without 4-cycles
- The red book of varieties and schemes
- Strongly minimal expansions of algebraically closed fields
- Regularity lemma for distal structures
- Crossing patterns of semi-algebraic sets
- Expanding polynomials over finite fields of large characteristic, and a regularity lemma for definable sets
- Overlap properties of geometric expanders
- On Certain Sets of Positive Density
- On sets of integers containing k elements in arithmetic progression
- Combinatorial theorems relative to a random set
- A short nonalgorithmic proof of the containers theorem for hypergraphs
- Model Theory
- THE METHOD OF HYPERGRAPH CONTAINERS
- Supersaturated Sparse Graphs and Hypergraphs
- Independent sets in hypergraphs
- Stochastic Algorithms: Foundations and Applications
This page was built for publication: Independent sets in algebraic hypergraphs
