The regularity method for graphs with few 4‐cycles

DOI10.1112/JLMS.12500MaRDI QIDQ5874028zbMATH OpenOpenAlexFDO

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

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) Sequences and sets (11B99) Additive number theory; partitions (11P99)

Recommendations

• Which graphs can be counted in C₄-free graphs?
• Efficient removal without efficient regularity
• Extremal results in sparse pseudorandom graphs
• On the maximum number of five-cycles in a triangle-free graph
• Sparse halves in dense triangle-free graphs

Cites work

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

Cited in

(15)

• Counting hypergraphs with large girth
• Regular decomposition of the edge set of a graph with applications
• An efficient asymmetric removal lemma and its limitations
• Extremal Sidon sets are Fourier uniform, with applications to partition regularity
• The sparse regularity method with Schatten norms and entropy
• Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022
• Many pentagons in triple systems
• Extremal results in sparse pseudorandom graphs
• Abundance: asymmetric graph removal lemmas and integer solutions to linear equations
• The regularity method for graphs with few 4-cycles
• A unified framework for light spanners
• Interview with David Conlon
• Invariant equations in many variables
• 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)