Hitting time for \(k\) edge-disjoint spanning trees in a random graph

DOI10.1007/BF01882200zbMath0846.05080OpenAlexW2049718279MaRDI QIDQ1914720

J. J. Spencer, Edgar M. Palmer

Publication date: 29 September 1996

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01882200

zbMATH Keywords

minimum degreerandom graphhitting timespanning trees

Mathematics Subject Classification ID

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

Related Items (3)

Hitting time results for Maker-Breaker games ⋮ Connected components and evolution of random graphs: An algebraic approach ⋮ Positional games on random graphs

Cites Work

• Unnamed Item
• An algorithm for finding Hamilton paths and cycles in random graphs
• Edge disjoint spanning trees in random graphs
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• A reduction method to find spanning Eulerian subgraphs
• A Note on Sub-Eulerian Graphs

This page was built for publication: Hitting time for \(k\) edge-disjoint spanning trees in a random graph