The regularity lemma and its applications in graph theory

Authors:
János Komlós;Ali Shokoufandeh;Miklós Simonovits;Endre Szemerédi
Affiliations:
Rutgers University, New Brunswick, NJ and Hungarian Academy of Sciences;Department of Mathematics and Computer Science, Drexel University, Philadelphia, PA;Rutgers University, New Brunswick, NJ and Hungarian Academy of Sciences;Rutgers University, New Brunswick, NJ and Hungarian Academy of Sciences
Venue:
Theoretical aspects of computer science
Year:
2002

Citing 24
Cited 6

On universality of graphs with uniformly distributed edges

Discrete Mathematics
Exact solution of some Tura´n-type problems

Journal of Combinatorial Theory Series A
On the communication complexity of graph properties

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Dense expanders and pseudo-random bipartite graphs

Discrete Mathematics
Extremal subgraphs of random graphs

Journal of Graph Theory
The maximum number of edges in a minimal graph of diameter 2

Journal of Graph Theory
The Square of a Hamiltonian Cycle

SIAM Journal on Discrete Mathematics
The algorithmic aspects of the regularity lemma

Journal of Algorithms
The Erdős-Ko-Rado theorem for small families

Journal of Combinatorial Theory Series A
The square of paths and cycles

Journal of Combinatorial Theory Series B
A Fast Approximation Algorithm for Computing theFrequencies of Subgraphs in a Given Graph

SIAM Journal on Computing
Tura´n's extremal problem in random graphs: forbidding even cycles

Journal of Combinatorial Theory Series B
2-factors in dense graphs

Discrete Mathematics
H-factors in dense graphs

Journal of Combinatorial Theory Series B
The number of edge colorings with no monochromatic triangle

Journal of Graph Theory
On the square of a Hamiltonian cycle in dense graphs

Proceedings of the seventh international conference on Random structures and algorithms
On an anti-Ramsey property of Ramanujan graphs

Random Structures & Algorithms
Szemerédi's regularity lemma for sparse graphs

FoCM '97 Selected papers of a conference on Foundations of computational mathematics
Threshold functions for asymmetric Ramsey properties involving cycles

Random Structures & Algorithms
An algorithmic version of the blow-up lemma

Random Structures & Algorithms
R(Cn, Cn,Cn) 0 (1)) n

Journal of Combinatorial Theory Series B
The Blow-up Lemma

Combinatorics, Probability and Computing
Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles

Combinatorics, Probability and Computing
On the Pósa-Seymour conjecture

Journal of Graph Theory

Regularity lemma for k-uniform hypergraphs

Random Structures & Algorithms
Applications of the regularity lemma for uniform hypergraphs

Random Structures & Algorithms
The counting lemma for regular k-uniform hypergraphs

Random Structures & Algorithms
Szemerédi's regularity lemma and its applications to pairwise clustering and segmentation

EMMCVPR'07 Proceedings of the 6th international conference on Energy minimization methods in computer vision and pattern recognition
A deterministic algorithm for the Frieze-Kannan regularity lemma

APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma

SIAM Journal on Discrete Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Szemerédi's Regularity Lemma is an important tool in discrete mathematics. It says that, in some sense, all graphs can be approximated by random-looking graphs. Therefore the lemma helps in proving theorems for arbitrary graphs whenever the corresponding result is easy for random graphs. In the last few years more and more new results were obtained by using the Regularity Lemma, and Mso some new variants and generalizations appeared. Komlós and Simonovits have written a survey on the topic [96]. The present survey is, in a sense, a continuation of the earlier survey. Here we describe some sample applications and generalizations. To keep the paper self-contained we decided to repeat (sometimes in a shortened form) parts of the first survey, but the emphasis is on new results.