Almost universal graphs

DOI10.1002/RSA.20121zbMATH Open1100.05091DBLPjournals/rsa/FriezeK06OpenAlexW4239890769WikidataQ57401501 ScholiaQ57401501MaRDI QIDQ5486325FDOQ5486325

Alan Frieze, Michael Krivelevich

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)

Cites Work

• Title not available (Why is that?)

Cited In (13)

• Expanders Are Universal for the Class of All Spanning Trees
• Almost all cop-win graphs contain a universal vertex
• An improved upper bound on the density of universal random graphs
• Title not available (Why is that?)
• Properties of Almost All Graphs and Generalized Quantifiers
• Universally signable graphs
• Feasible graphs with standard universe
• Graph Traversals as Universal Constructions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Some remarks on universal graphs
• Universal geometric graphs
• Sharp threshold for the appearance of certain spanning trees in random graphs

   Recommendations

• Explicit sparse almost-universal graphs for \(\mathcal G (n, \frac kn)\) 👍 👎
• Almost‐spanning universality in random graphs 👍 👎
• Almost-spanning universality in random graphs (extended abstract) 👍 👎
• Universality of random graphs 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Almost universal graphs

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