Embedding degenerate graphs of small bandwidth

Choongbum Lee

Embedding degenerate graphs of small bandwidth

Combinatorics 2015-01-27 v2

Authors: Choongbum Lee

Abstract

We develop a tool for embedding almost spanning degenerate graphs of small bandwidth. As an application, we extend the blow-up lemma to degenerate graphs of small bandwidth, the bandwidth theorem to degenerate graphs, and make progress on a conjecture of Burr and Erd\H{o}s on Ramsey number of degenerate graphs.

Keywords

random graphs graph theory network theory

Cite

@article{arxiv.1501.05350,
  title  = {Embedding degenerate graphs of small bandwidth},
  author = {Choongbum Lee},
  journal= {arXiv preprint arXiv:1501.05350},
  year   = {2015}
}

Comments

39 pages, 2 figures

Related papers

View all related →