Linear arboricity of random regular graphs

DOI10.1002/rsa.3240010405zbMath0744.05048OpenAlexW2044883920MaRDI QIDQ3970908

Colin J. H. McDiarmid, Bruce A. Reed

Publication date: 25 June 1992

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

Full work available at URL: https://doi.org/10.1002/rsa.3240010405

zbMATH Keywords

random regular graphslinear arboricitylinear forestlinear arboricity conjecture

Mathematics Subject Classification ID

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

Related Items (8)

Graph factors and factorization: 1985--2003: a survey ⋮ Minimum number of disjoint linear forests covering a planar graph ⋮ Linear arboricity of degenerate graphs ⋮ A decomposition method on solving the linear arboricity conjecture ⋮ Almost Every Graph can be Covered by Linear Forests ⋮ Optimal path and cycle decompositions of dense quasirandom graphs ⋮ Towards the linear arboricity conjecture ⋮ The conjunction of the linear arboricity conjecture and Lovász's path partition theorem

Cites Work

• Unnamed Item

This page was built for publication: Linear arboricity of random regular graphs