Blow-Up Lemma

@article{Komls1997BlowUpL,
  title={Blow-Up Lemma},
  author={J{\'a}nos Koml{\'o}s and G{\'a}bor N. S{\'a}rk{\"o}zy and Endre Szemer{\'e}di},
  journal={Combinatorica},
  year={1997},
  volume={17},
  pages={109-123}
}
The Regularity Lemma [16] is a powerful tool in Graph Theory and its applications. It basically says that every graph can be well approximated by the union of a constant number of random-looking bipartite graphs called regular pairs (see the definitions below). These bipartite graphs share many local properties with random bipartite graphs, e.g. most degrees are about the same, most pairs of vertices have about as many common neighbours as is expected in a random graph, and so on. These… CONTINUE READING
BETA

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 96 CITATIONS, ESTIMATED 44% COVERAGE

219 Citations

01020'00'04'09'14'19
Citations per Year
Semantic Scholar estimates that this publication has 219 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
SHOWING 1-7 OF 7 REFERENCES

SIMONOVITS : Szemer 6 di ' s Regularity Lemma and its applications in graph theory

  • M.
  • Bolyai Society Mathematical Studies 2…
  • 1993

YUSTER : Algorithmic aspects of the regularity lemma

  • H. LEFFMAN, V. RODL, R.
  • FOCS
  • 1993

KALAI : Regular subgraphs of almost regular graphs

  • S. FRIEDLAND N. ALON, G.
  • J . Combinatorial Theory , B
  • 1984

HAJNAL : On the maximal number of independent circuits in a graph

  • A.
  • Acta Math . Acad . Sci . Hung .
  • 1963

SOS , and P . TURJ ~ N : On a problem of Zarankiewicz , Colloq

  • T. VERA
  • 1954

STONE : On the structure of linear graphs

  • H. A.
  • Bull . Amer . Math . Soc .
  • 1946

KALAI : Every & regular graph plus an edge contains a 3regular subgraph

  • G.
  • J . Combinatorial Theory , B

Similar Papers

Loading similar papers…