Embedding large graphs into a random graph

DOI10.1112/BLMS.12066zbMath1372.05199arXiv1606.05923OpenAlexW3126108959MaRDI QIDQ5371058

Oanh Nguyen, Kyle Luh, Asaf Ferber

Publication date: 24 October 2017

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

embeddingbounded degree graphalmost-spanning graph

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 (6)

The threshold bias of the clique-factor game ⋮ 2-universality in randomly perturbed graphs ⋮ Thresholds versus fractional expectation-thresholds ⋮ Random perturbation of sparse graphs ⋮ Optimal threshold for a random graph to be 2-universal ⋮ Spanning trees in random graphs

This page was built for publication: Embedding large graphs into a random graph