Almost universal graphs

DOI10.1002/rsa.20121zbMath1100.05091DBLPjournals/rsa/FriezeK06OpenAlexW4239890769WikidataQ57401501 ScholiaQ57401501MaRDI QIDQ5486325

Michael Krivelevich, Alan M. Frieze

Publication date: 6 September 2006

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20121

zbMATH Keywords

phase transitionsubgraphs of random graphsuniversal graphs for bounded-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)

Related Items (4)

Expanders Are Universal for the Class of All Spanning Trees ⋮ An improved upper bound on the density of universal random graphs ⋮ Unnamed Item ⋮ Sharp threshold for the appearance of certain spanning trees in random graphs

Cites Work

• Unnamed Item

This page was built for publication: Almost universal graphs