Almost‐spanning universality in random graphs

DOI10.1002/rsa.20661zbMath1364.05061arXiv1503.05612OpenAlexW1925283345MaRDI QIDQ5739095

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

Publication date: 2 June 2017

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

Full work available at URL: https://arxiv.org/abs/1503.05612

zbMATH Keywords

random graphsbounded degree graphsuniversality

Mathematics Subject Classification ID

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

Related Items

Universal and unavoidable graphs, The size‐Ramsey number of cubic graphs, Finding any given 2‐factor in sparse pseudorandom graphs efficiently, Spanning structures and universality in sparse hypergraphs, On universal hypergraphs, Optimal threshold for a random graph to be 2-universal

Cites Work

• Sparse partition universal graphs for graphs of bounded degree
• Sparse universal graphs
• Universality of random graphs and rainbow embedding
• Almost spanning subgraphs of random graphs after adversarial edge removal
• Universality of Random Graphs for Graphs of Maximum Degree Two
• 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 size Ramsey number of paths, trees, and circuits. I
• On Universal Graphs for Spanning Trees
• An improved upper bound on the density of universal random graphs
• Sparse universal graphs for bounded‐degree graphs