Edge disjoint spanning trees in random graphs

DOI10.1007/BF01946380zbMath0735.05076MaRDI QIDQ1814020

Tomasz Łuczak, Alan M. Frieze

Publication date: 25 June 1992

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

zbMATH Keywords

random graphsspanning trees

Mathematics Subject Classification ID

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

Related Items (4)

On the Thickness of Sparse Random Graphs ⋮ Hitting time for \(k\) edge-disjoint spanning trees in a random graph ⋮ Supereulerian graphs: A survey ⋮ Connected components and evolution of random graphs: An algebraic approach

Cites Work

• On the connectivity of random m-orientable graphs and digraphs
• Maximum matchings in a class of random graphs
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• A Note on Sub-Eulerian Graphs

This page was built for publication: Edge disjoint spanning trees in random graphs