Almost-spanning universality in random graphs (extended abstract)

DOI10.1016/j.endm.2015.06.030zbMath1346.05264OpenAlexW2212944932MaRDI QIDQ322227

Asaf Ferber, Rajko Nenadov, Nemanja Škorić, David Conlon

Publication date: 14 October 2016

Full work available at URL: https://resolver.caltech.edu/CaltechAUTHORS:20190812-162957531

zbMATH Keywords

random graphsuniversalitybounded-degree graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Unnamed Item
• Sparse universal graphs
• An Improved Upper Bound on the Density of Universal Random Graphs
• Local resilience of almost spanning trees in random graphs
• Universal Graphs for Bounded-Degree Trees and Planar Graphs
• On Graphs Which Contain All Sparse Graphs
• Hall's theorem for hypergraphs
• On Universal Graphs for Spanning Trees
• Sparse universal graphs for bounded‐degree graphs