Embedding spanning subgraphs of small bandwidth.

Zentrum Mathematik, Technische Universität München, Boltzmannstraße 3, D-85747 Garching bei München, Germany
Electronic Notes in Discrete Mathematics 01/2007; 29:485-489. DOI: 10.1016/j.endm.2007.07.075
Source: DBLP

ABSTRACT Abstract In this paper we prove the following conjecture by Bollob´as and Koml´os: For every > 0 and positive integers r and �, there exists � > 0 with the following property. If G is a sufficiently large graph withn vertices and minimum,degree at least ( The first and third author were supported by DFG grant TA 309/2-1. The second author was supported by DFG grant SCHA 1263/1-1. 1 Introduction and results One of the fundamental results in extremal graph theory is the theorem by

  • [Show abstract] [Hide abstract]
    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.
    Combinatorics Probability and Computing 01/1999; 8(1&2). · 0.61 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    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 also 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.
    Theoretical Aspects of Computer Science, Advanced Lectures (First Summer School on Theoretical Aspects of Computer Science, Tehran, Iran, July 2000); 01/2000
  • Proceedings of the London Mathematical Society 01/1952; · 1.12 Impact Factor


Available from