Universality of random graphs

DOI10.1137/10079882XzbMATH Open1245.05113OpenAlexW2054633324WikidataQ105584129 ScholiaQ105584129MaRDI QIDQ2902906FDOQ2902906

Authors: Domingos Dellamonica, Yoshiharu Kohayakawa, Vojtěch Rödl, Andrzej Ruciński 

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

Recommendations

• An improved upper bound on the density of universal random graphs
• An improved upper bound on the density of universal random graphs
• Spanning universality in random graphs
• Universality of Random Graphs for Graphs of Maximum Degree Two
• Almost-spanning universality in random graphs

zbMATH Keywords

graph embeddingrandom graphsuniversalitybounded degree graphs

Mathematics Subject Classification ID

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

Cited In (23)

• Universal edge scaling in random partitions
• Spanning structures and universality in sparse hypergraphs
• Expanders Are Universal for the Class of All Spanning Trees
• Universality for distances in power-law random graphs
• Almost universal graphs
• An improved upper bound on the density of universal random graphs
• On universality of graphs with uniformly distributed edges
• Sandwiching biregular random graphs
• Spanning universality in random graphs
• An improved upper bound on the density of universal random graphs
• Almost-spanning universality in random graphs (extended abstract)
• Almost spanning universality in random graphs
• Universality of graphs with few triangles and anti-triangles
• Universality of random graphs and rainbow embedding
• Global Structural Properties of Random Graphs
• 2-universality in randomly perturbed graphs
• On universal representation of random graphs
• Almost-spanning universality in random graphs
• A counter-example to the probabilistic universal graph conjecture via randomized communication complexity
• Universality of Random Graphs for Graphs of Maximum Degree Two
• Sparse multipartite graphs as partition universal for graphs with bounded degree
• Sandwiching random graphs: universality between random graph models
• Unimodular lattice triangulations as small-world and scale-free random graphs

This page was built for publication: Universality of random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2902906)