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 08/2007; 29:485-489. DOI: 10.1016/j.endm.2007.07.075
Source: DBLP


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

8 Reads


8 Reads
Available from