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

DOI10.1007/BF01882200MaRDI QIDQ1914720zbMATH OpenOpenAlexFDO

Authors 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

hitting timeminimum degreerandom graphspanning trees

Mathematics Subject Classification ID

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

Cites work

• A Note on Sub-Eulerian Graphs
• A reduction method to find spanning Eulerian subgraphs
• An algorithm for finding Hamilton paths and cycles in random graphs
• Edge disjoint spanning trees in random graphs
• Edge-Disjoint Spanning Trees of Finite Graphs
• scientific article; zbMATH DE number 3950585 (Why is no real title available?)
• On the Problem of Decomposing a Graph into n Connected Factors

Cited in

(4)

• Hitting time results for maker-breaker games
• A Spanning Tree Method for Bounding Hitting Times of Random Walks on Graphs
• Positional games on random graphs
• Connected components and evolution of random graphs: An algebraic approach

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1914720)