The regularity method for graphs with few 4‐cycles
DOI10.1112/JLMS.12500OpenAlexW3204099224MaRDI QIDQ5874028FDOQ5874028
Authors: David Conlon, Jacob Fox, Yufei Zhao, Benny Sudakov 
Publication date: 10 February 2023
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.10180
Recommendations
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Sequences and sets (11B99) Additive number theory; partitions (11P99)
Cites Work
- Large networks and graph limits
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Extremal results in sparse pseudorandom graphs
- Extremal results for random discrete structures
- Combinatorial theorems in sparse random sets
- On sets of integers containing k elements in arithmetic progression
- Hypergraph containers
- Independent sets in hypergraphs
- On Graphs that do not Contain a Thomsen Graph
- Title not available (Why is that?)
- On the number of graphs without 4-cycles
- The primes contain arbitrarily long arithmetic progressions
- On Certain Sets of Integers
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- Solving a linear equation in a set of integers I
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
- Compactness results in extremal graph theory
- A relative Szemerédi theorem
- Title not available (Why is that?)
- Quick approximation to matrices and applications
- Szemerédi's lemma for the analyst
- On \(K^ 4\)-free subgraphs of random graphs
- A removal lemma for systems of linear equations over finite fields
- Regularity lemmas for graphs
- A proof of Green's conjecture regarding the removal properties of sets of linear equations
- Title not available (Why is that?)
- Szemerédi’s Regularity Lemma for Sparse Graphs
- On the KŁR conjecture in random graphs
- A new proof of the graph removal lemma
- A combinatorial proof of the removal lemma for groups
- Graph removal lemmas
- On the existence of triangulated spheres in 3-graphs, and related problems
- On hypergraphs of girth five
- Szemerédi's regularity Lemma for matrices and sparse graphs
- The sparse regularity lemma and its applications
- Turán numbers of bipartite graphs plus an odd cycle
- Pentagons vs. triangles
- \(k\)-fold Sidon sets
- The Green-Tao theorem: an exposition
- Counting independent sets in graphs
- On 3-uniform hypergraphs without a cycle of a given length
- Many \(T\) copies in \(H\)-free graphs
- Asymptotics of the number of sum-free sets in abelian groups of even order.
- Turán numbers for Berge-hypergraphs and related extremal problems
- A note on the maximum number of triangles in a C5‐free graph
- An arithmetic transference proof of a relative Szemerédi theorem
- Solving equations in dense Sidon sets
Cited In (9)
- Counting hypergraphs with large girth
- Regular decomposition of the edge set of a graph with applications
- Extremal Sidon sets are Fourier uniform, with applications to partition regularity
- Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022
- Abundance: asymmetric graph removal lemmas and integer solutions to linear equations
- A unified framework for light spanners
- Interview with David Conlon
- New minimal (4; n)-regular matchstick graphs
- Making an H $H$‐free graph k $k$‐colorable
This page was built for publication: The regularity method for graphs with few 4‐cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874028)
