Spanning universality in random graphs

DOI10.1002/rsa.20816zbMath1405.05160arXiv1707.07914OpenAlexW2963626014MaRDI QIDQ4625020

Rajko Nenadov, Asaf Ferber

Publication date: 20 February 2019

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

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

zbMATH Keywords

random graphsuniversalityspanning subgraphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Related Items

2-universality in randomly perturbed graphs, Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu, Finding any given 2‐factor in sparse pseudorandom graphs efficiently, Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs, Random perturbation of sparse graphs, Clique-factors in sparse pseudorandom graphs