Universality of random graphs and rainbow embedding

  title={Universality of random graphs and rainbow embedding},
  author={A. Ferber and R. Nenadov and Ueli Peter},
  journal={Random Struct. Algorithms},
  • 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
    27 Citations
    Spanning structures and universality in sparse hypergraphs
    • 15
    • PDF
    Size Ramsey numbers of triangle-free graphs with bounded degree
    • 2
    • PDF
    Almost-spanning universality in random graphs
    • 15
    • PDF
    Almost spanning universality in random graphs
    • PDF
    Almost-spanning universality in random graphs (Extended abstract)
    • PDF
    Blow-up lemmas for sparse graphs
    • 40
    • PDF
    Spanning universality in random graphs
    • 10
    • PDF


    Expanders Are Universal for the Class of All Spanning Trees
    • 20
    • PDF
    Local resilience of almost spanning trees in random graphs
    • 62
    • PDF
    Matching and covering the vertices of a random graph by copies of a given graph
    • A. Rucinski
    • Computer Science, Mathematics
    • Discret. Math.
    • 1992
    • 34
    An improved upper bound on the density of universal random graphs
    • 10
    • Highly Influential
    Embedding nearly-spanning bounded degree trees
    • 51
    • PDF
    Sparse universal graphs for bounded-degree graphs
    • 33
    Factors in random graphs
    • 70
    Sparse universal graphs
    • 30
    • PDF
    Explicit sparse almost-universal graphs for G(n, k/n)
    • 5