Almost Every Graph can be Covered by Linear Forests

DOI10.1017/S0963548300001632zbMath0852.05069MaRDI QIDQ4862746

Bruce A. Reed, Colin J. H. McDiarmid

Publication date: 12 February 1996

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

linear arboricityrandom variableprobabilistic methodsmaximum degreelinear forest

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

On the linearK-arboricity of cubic graphs ⋮ Graph factors and factorization: 1985--2003: a survey

Cites Work

• The linear arboricity of graphs
• Canonical edge-colourings of locally finite graphs
• The tail of the hypergeometric distribution
• Probabilistic methods in coloring and decomposition problems
• The linear arboricity of some regular graphs
• Some results on linear arboricity
• Covering and packing in graphs IV: Linear arboricity
• Linear arboricity of random regular graphs
• Probability Inequalities for Sums of Bounded Random Variables
• COVERING AND PACKING IN GRAPHS, I.

This page was built for publication: Almost Every Graph can be Covered by Linear Forests