• DOI:10.1002/rsa.20596
Corpus ID: 7012453

Universality of random graphs and rainbow embedding

@article{Ferber2016UniversalityOR,
  title={Universality of random graphs and rainbow embedding},
  author={A. Ferber and R. Nenadov and Ueli Peter},
  journal={Random Struct. Algorithms},
  year={2016},
  volume={48},
  pages={546-564}
}

A. Ferber, R. Nenadov, Ueli Peter

Published 2016

Mathematics, Computer Science

Random Struct. Algorithms

In this paper we show how to use simple partitioning lemmas in order to embed spanning graphs in a typical member of . Let the maximum density of a graph H be the maximum average degree of all the subgraphs of H. First, we show that for , a graph w.h.p. contains copies of all spanning graphs H with maximum degree at most Δ and maximum density at most d. For , this improves a result of Dellamonica, Kohayakawa, Rodl and Rucincki. Next, we show that if we additionally restrict the spanning graphs… CONTINUE READING

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed