Cookies?
Library Header Image
LSE Research Online LSE Library Services

Proof of the bandwidth conjecture of Bollobás and Komlós

Böttcher, Julia, Schacht , Mathais and Taraz, Anusch (2009) Proof of the bandwidth conjecture of Bollobás and Komlós. Mathematische Annalen, 343 (1). pp. 175-205. ISSN 1432-1807

Full text not available from this repository.

Abstract

In this paper we prove the following conjecture by Bollobás and Komlós: For every γ > 0 and integers r ≥ 1 and Δ, there exists β > 0 with the following property. If G is a sufficiently large graph with n vertices and minimum degree at least ((r − 1)/r + γ)n and H is an r-chromatic graph with n vertices, bandwidth at most β n and maximum degree at most Δ, then G contains a copy of H.

Item Type: Article
Official URL: http://www.springerlink.com/content/0025-5831/
Additional Information: © 2008 Springer-Verlag
Library of Congress subject classification: Q Science > QA Mathematics
Sets: Departments > Mathematics
Rights: http://www.lse.ac.uk/library/usingTheLibrary/academicSupport/OA/depositYourResearch.aspx
Date Deposited: 28 May 2012 15:35
URL: http://eprints.lse.ac.uk/44110/

Actions (login required)

Record administration - authorised staff only Record administration - authorised staff only