Abundance: asymmetric graph removal lemmas and integer solutions to linear equations
From MaRDI portal
Publication:6641588
DOI10.1112/jlms.70015MaRDI QIDQ6641588
Unnamed Author, Freddie Illingworth, Lukas Michel, António Girão
Publication date: 20 November 2024
Published in: Journal of the London Mathematical Society. Second Series (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Other combinatorial number theory (11B75) Counting solutions of Diophantine equations (11D45) Structural characterization of families of graphs (05C75) Linear Diophantine equations (11D04)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
- On sparse graphs with given colorings and homomorphisms.
- Ein Satz über trigonometrische Polynome und seine Anwendung in der Theorie der Fourier-Reihen
- A polynomial bound for the arithmetic \(k\)-cycle removal lemma in vector spaces
- A tight bound for Green's arithmetic triangle removal lemma in vector spaces
- Efficient removal lemmas for matrices
- On extremal problems of graphs and generalized graphs
- Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs
- Solving a linear equation in a set of integers I
- The Algorithmic Aspects of the Regularity Lemma
- Testing subgraphs in large graphs
- Removal lemmas with polynomial bounds
- Polynomial removal lemmas for ordered graphs
- Easily Testable Graph Properties
- Non-trivial solutions to a linear equation in integers
- Behrend-type constructions for sets of linear equations
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- The regularity method for graphs with few 4‐cycles
- Testing subgraphs in directed graphs
- Many \(T\) copies in \(H\)-free graphs
This page was built for publication: Abundance: asymmetric graph removal lemmas and integer solutions to linear equations
