Spanning trees in randomly perturbed graphs

DOI10.1002/rsa.20886zbMath1444.05132arXiv1803.04958OpenAlexW2981247787MaRDI QIDQ5113937

Felix Joos, Jae-Hoon Kim

Publication date: 19 June 2020

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

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

zbMATH Keywords

random graphstreesgraph embedding

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Vertex degrees (05C07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (11)

Triangles in randomly perturbed graphs ⋮ 2-universality in randomly perturbed graphs ⋮ Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu ⋮ Factors in randomly perturbed hypergraphs ⋮ Hamiltonicity of graphs perturbed by a random regular graph ⋮ On powers of tight Hamilton cycles in randomly perturbed hypergraphs ⋮ Hamiltonicity of graphs perturbed by a random geometric graph ⋮ Tree decompositions of graphs without large bipartite holes ⋮ Random perturbation of sparse graphs ⋮ Vertex Ramsey properties of randomly perturbed graphs ⋮ Ramsey properties of randomly perturbed graphs: cliques and cycles

This page was built for publication: Spanning trees in randomly perturbed graphs