Library Header Image
LSE Research Online LSE Library Services

Bandwidth, treewidth, separators, expansion, and universality

Böttcher, Julia ORCID: 0000-0002-4104-3635, Pruessmann, Klaas P., Taraz, Anusch and Würfl, Andreas (2008) Bandwidth, treewidth, separators, expansion, and universality. Electronic Notes in Discrete Mathematics, 31. pp. 91-96. ISSN 1571-0653

Full text not available from this repository.
Identification Number: 10.1016/j.endm.2008.06.018


We prove that planar graphs with bounded maximum degree have sublinear bandwidth. As a consequence for each γ>0 every n-vertex graph with minimum degree (3/4+γ)n source contains a copy of every bounded-degree planar graph on n vertices. The proof relies on the fact that planar graphs have small separators. Indeed, we show more generally that for any class of bounded-degree graphs the concepts of sublinear bandwidth, sublinear treewidth, the absence of big expanders as subgraphs, and the existence of small separators are equivalent.

Item Type: Article
Official URL:
Additional Information: © 2008 Elsevier B.V.
Divisions: Mathematics
Subjects: Q Science > QA Mathematics
Date Deposited: 28 May 2012 15:38
Last Modified: 16 May 2024 00:48

Actions (login required)

View Item View Item