Hostname: page-component-cd9895bd7-mkpzs Total loading time: 0 Render date: 2024-12-27T21:14:45.987Z Has data issue: false hasContentIssue false
  • English
  • Français

The Blow-up Lemma

Published online by Cambridge University Press:  01 January 1999

JÁNOS KOMLÓS
JÁNOS KOMLÓS
Affiliation:
Department of Mathematics, Rutgers University, New Brunswick, NJ 08903, USA (e-mail: komlos@math.rutgers.edu)
Get access Rights & Permissions [Opens in a new window]

Abstract

Extremal graph theory has a great number of conjectures concerning the embedding of large sparse graphs into dense graphs. Szemerédi's Regularity Lemma is a valuable tool in finding embeddings of small graphs. The Blow-up Lemma, proved recently by Komlós, Sárközy and Szemerédi, can be applied to obtain approximate versions of many of the embedding conjectures. In this paper we review recent developments in the area.

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 8 , Issue 1-2 , January 1999 , pp. 161 - 176
Copyright
© 1999 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)