The regularity method for graphs with few 4‐cycles

DOI10.1112/jlms.12500OpenAlexW3204099224MaRDI QIDQ5874028

David Conlon, Jacob Fox, Yufei Zhao, Benjamin 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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Additive number theory; partitions (11P99) Sequences and sets (11B99)

Related Items (4)

Counting hypergraphs with large girth ⋮ Making an H $H$‐free graph k $k$‐colorable ⋮ Extremal Sidon sets are Fourier uniform, with applications to partition regularity ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extremal results for random discrete structures
• Combinatorial theorems in sparse random sets
• Turán numbers of bipartite graphs plus an odd cycle
• \(k\)-fold Sidon sets
• On the KŁR conjecture in random graphs
• The Green-Tao theorem: an exposition
• Hypergraph containers
• On 3-uniform hypergraphs without a cycle of a given length
• A new proof of the graph removal lemma
• Asymptotics of the number of sum-free sets in abelian groups of even order.
• Szemerédi's lemma for the analyst
• Pentagons vs. triangles
• A combinatorial proof of the removal lemma for groups
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• Quick approximation to matrices and applications
• On the number of graphs without 4-cycles
• On \(K^ 4\)-free subgraphs of random graphs
• On hypergraphs of girth five
• A removal lemma for systems of linear equations over finite fields
• Compactness results in extremal graph theory
• Turán numbers for Berge-hypergraphs and related extremal problems
• Counting independent sets in graphs
• A relative Szemerédi theorem
• The primes contain arbitrarily long arithmetic progressions
• Extremal results in sparse pseudorandom graphs
• On the existence of triangulated spheres in 3-graphs, and related problems
• Graph removal lemmas
• Szemerédi's Regularity Lemma for Matrices and Sparse Graphs
• A proof of Green's conjecture regarding the removal properties of sets of linear equations
• On sets of integers containing k elements in arithmetic progression
• Solving a linear equation in a set of integers I
• Szemerédi’s Regularity Lemma for Sparse Graphs
• A note on the maximum number of triangles in a C₅‐free graph
• Solving equations in dense Sidon sets
• Independent sets in hypergraphs
• An arithmetic transference proof of a relative Szemerédi theorem
• On Graphs that do not Contain a Thomsen Graph
• On Certain Sets of Integers
• On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
• Many \(T\) copies in \(H\)-free graphs

This page was built for publication: The regularity method for graphs with few 4‐cycles