Universality of Random Graphs

DOI10.1137/10079882XzbMath1245.05113OpenAlexW2054633324WikidataQ105584129 ScholiaQ105584129MaRDI QIDQ2902906

Andrzej Ruciński, Domingos jun. Dellamonica, Vojtěch Rödl, Yoshiharu Kohayakawa

Publication date: 22 August 2012

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/10079882x

zbMATH Keywords

random graphsbounded degree graphsuniversalitygraph embedding

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (4)

Spanning structures and universality in sparse hypergraphs ⋮ Sparse multipartite graphs as partition universal for graphs with bounded degree ⋮ Expanders Are Universal for the Class of All Spanning Trees ⋮ An improved upper bound on the density of universal random graphs

This page was built for publication: Universality of Random Graphs