Embedding Spanning Trees in Random Graphs
From MaRDI portal
Publication:3013142
DOI10.1137/100805753zbMath1221.05283arXiv1007.2326OpenAlexW2026053156MaRDI QIDQ3013142
Publication date: 18 July 2011
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1007.2326
Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (26)
On the Erdős–Sós conjecture for trees with bounded degree ⋮ Fast Strategies In Maker–Breaker Games Played on Random Boards ⋮ The total acquisition number of random graphs ⋮ Maximal planar subgraphs of fixed girth in random graphs ⋮ Understanding chicken walks on n × n grid: Hamiltonian paths, discrete dynamics, and rectifiable paths ⋮ Building Spanning Trees Quickly in Maker-Breaker Games ⋮ Spanning structures and universality in sparse hypergraphs ⋮ An accurate, scalable and verifiable protocol for federated differentially private averaging ⋮ Bounded-Degree Spanning Trees in Randomly Perturbed Graphs ⋮ Cycle Factors and Renewal Theory ⋮ Edge-disjoint spanning trees and eigenvalues of regular graphs ⋮ Fast strategies in Waiter-Client games ⋮ Fast embedding of spanning trees in biased maker-breaker games ⋮ Ramsey Goodness of Bounded Degree Trees ⋮ Thresholds versus fractional expectation-thresholds ⋮ Expanders Are Universal for the Class of All Spanning Trees ⋮ The threshold for combs in random graphs ⋮ Random perturbation of sparse graphs ⋮ Packing trees of unbounded degrees in random graphs ⋮ Nonvertex‐Balanced Factors in Random Graphs ⋮ Optimal threshold for a random graph to be 2-universal ⋮ Spanning trees in random graphs ⋮ Counting spanning trees in self-similar networks by evaluating determinants ⋮ Unnamed Item ⋮ The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition ⋮ Sharp threshold for the appearance of certain spanning trees in random graphs
This page was built for publication: Embedding Spanning Trees in Random Graphs
