The conjunction of the linear arboricity conjecture and Lovász's path partition theorem

DOI10.1016/j.disc.2021.112434zbMath1466.05177OpenAlexW3153366694WikidataQ113877047 ScholiaQ113877047MaRDI QIDQ2032853

Yanli Hao, Guantao Chen

Publication date: 14 June 2021

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2021.112434

zbMATH Keywords

\(k\)-degenerate graphdense random graphslinear arboricity conjectureGallai's path partition conjecture

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Density (toughness, etc.) (05C42)

Related Items (2)

Rainbow subgraphs in Hamiltonian cycle decompositions of complete graphs ⋮ Orientation‐based edge‐colorings and linear arboricity of multigraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The linear arboricity of graphs
• Path decompositions and Gallai's conjecture
• Covering the edges of a connected graph by paths
• Towards the linear arboricity conjecture
• Beautiful conjectures in graph theory
• The linear arboricity of planar graphs of maximum degree seven is four
• Covering and packing in graphs IV: Linear arboricity
• Linear arboricity of random regular graphs
• Optimal path and cycle decompositions of dense quasirandom graphs

This page was built for publication: The conjunction of the linear arboricity conjecture and Lovász's path partition theorem