A proof of Green's conjecture regarding the removal properties of sets of linear equations
From MaRDI portal
Publication:3550257
DOI10.1112/jlms/jdp076zbMath1218.05071arXiv0807.4901OpenAlexW3102089577WikidataQ122903090 ScholiaQ122903090MaRDI QIDQ3550257
Publication date: 31 March 2010
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0807.4901
Extremal problems in graph theory (05C35) Specification and verification (program logics, model checking, etc.) (68Q60) Arithmetic combinatorics; higher degree uniformity (11B30)
Related Items (22)
Induced arithmetic removal: complexity 1 patterns over finite fields ⋮ Online containers for hypergraphs, with applications to linear equations ⋮ On linear configurations in subsets of compact abelian groups, and invariant measurable hypergraphs ⋮ A note on sparse supersaturation and extremal results for linear homogeneous systems ⋮ Sunflowers and testing triangle-freeness of functions ⋮ Testing Linear-Invariant Properties ⋮ Finding solutions with distinct variables to systems of linear equations over \(\mathbb{F}_p\) ⋮ When the sieve works. II ⋮ A counting lemma for binary matroids and applications to extremal problems ⋮ Local-vs-global combinatorics ⋮ On arithmetic progressions in symmetric sets in finite field model ⋮ A new proof of the graph removal lemma ⋮ Counting configuration-free sets in groups ⋮ A removal lemma for linear configurations in subsets of the circle ⋮ Hypergraph containers ⋮ On the number of monochromatic solutions of integer linear systems on Abelian groups ⋮ Counting configuration-free sets in groups ⋮ A removal lemma for systems of linear equations over finite fields ⋮ On the number of monochromatic solutions of integer linear systems on abelian groups ⋮ A combinatorial proof of the removal lemma for groups ⋮ The regularity method for graphs with few 4‐cycles ⋮ A relative Szemerédi theorem
This page was built for publication: A proof of Green's conjecture regarding the removal properties of sets of linear equations