## Abstract

A*linear forest* is a forest in which each connected component is a path. The*linear arboricity* la(*G*) of a graph*G* is the minimum number of linear forests whose union is the set of all edges of*G*. The*linear arboricity conjecture* asserts that for every simple graph*G* with maximum degree Δ=Δ(*G*),\(la(G) \leqq [\frac{{\Delta + 1}}{2}].\). Although this conjecture received a considerable amount of attention, it has been proved only for Δ≦6, Δ=8 and Δ=10, and the best known general upper bound for la(*G*) is la(*G*)≦⌈3Δ/5⌉ for even Δ and la(*G*)≦⌈(3Δ+2)/5⌉ for odd Δ. Here we prove that for every*ɛ*>0 there is a Δ_{0}=Δ_{0}(*ɛ*) so that la(*G*)≦(1/2+*ɛ*)Δ for every*G* with maximum degree Δ≧Δ_{0}. To do this, we first prove the conjecture for every*G* with an even maximum degree Δ and with*girth g*≧50Δ.

## Keywords

Maximum Degree Pairwise Disjoint Regular Graph Dependency Graph Span Subgraph## Preview

Unable to display preview. Download preview PDF.

## References

- [A]J. Akiyama,
*A status on the linear arboricity*, Lecture Notes in Comp. Science**108**, New York, 1981, pp. 38–44.Google Scholar - [AA]I. Algor and N. Alon,
*The star arboricity of graphs*, in preparation.Google Scholar - [AC]J. Akiyama and V. Chvátal,
*A short proof of the linear arboricity for cubic graphs*, Bull. Liber. Arts & Sci., NMS No. 2 (1981), 1–3.Google Scholar - [AD]H. Ait-Djafter,
*Linear arboricity for graphs with maximum degree six or seven and edgemultiplicity two*, Ars Combinatoria**20**(1985), 5–16.Google Scholar - [AEH1]J. Akiyama, G. Exoo and F. Harary,
*Covering and packing in graphs III. Cyclic and acyclic invariants*, Math. Slovaca**30**(1980), 405–417.zbMATHMathSciNetGoogle Scholar - [AEH2]J. Akiyama, G. Exoo and F. Harary,
*Covering and packing in graphs IV. Linear arboricity*, Networks**11**(1981), 69–72.zbMATHCrossRefMathSciNetGoogle Scholar - [AK]J. Akiyama and M. Kano,
*Path factors of a graph*, in:*Graph Theory and its Applications*, Wiley and Sons, New York, 1984.Google Scholar - [Ao]Y. Aoki,
*The star arboricity of the complete regular multipartite graphs*, preprint.Google Scholar - [AS]J. Akiyama and I. Saito,
*A comment on the linear arboricity for regular multigraphs*, to appear.Google Scholar - [B]B. Bollobás,
*Random Graphs*, Academic Press, London, 1985, p. 11.zbMATHGoogle Scholar - [BFHP]J. C. Bermond, J. L. Fouquet, M. Habib and B. Peroche,
*On linear k-arboricity*, Discrete Math.**43**(1984), 123–132.CrossRefMathSciNetGoogle Scholar - [BM]J. A. Bondy and U. S. R. Murty,
*Graph Theory with Applications*, Macmillan Press, London, 1976.Google Scholar - [E]H. Enomoto,
*The linear arboricity of 5-regular graphs*, Technical Report, Dept. of Information Sci., Univ. of Tokyo, 1981.Google Scholar - [EL]P. Erdös and L. Lovász,
*Problems and results on 3-chromatic hypergraphs and some related questions*, in*Infinite and Finite Sets*(A. Hajnal*et al.*, eds.), North-Holland, Amsterdam, 1975, pp. 609–628.Google Scholar - [EP]H. Enomoto and B. Peroche,
*The linear arboricity of some regular graphs*, J. Graph Theory**8**(1984), 309–324.zbMATHCrossRefMathSciNetGoogle Scholar - [G1]F. Guldan,
*The linear arboricity of 10-regular graphs*, Math. Slovaca**36**(1986), 225–228.zbMATHMathSciNetGoogle Scholar - [G2]F. Guldan,
*Some results on linear arboricity*, J. Graph Theory**10**(1986), 505–509.zbMATHCrossRefMathSciNetGoogle Scholar - [H]F. Harary,
*Covering and packing in graphs I.*, Ann. N.Y. Acad. Sci.**175**(1970), 198–205.zbMATHGoogle Scholar - [HP1]M. Habib and B. Peroche,
*Some problems about linear arboricity*, Discrete Math.**41**(1982), 219–220.zbMATHCrossRefMathSciNetGoogle Scholar - [HP2]M. Habib and B. Peroche,
*La k-arboricité linéaire des arbres*, in*Combinatorial Mathematics*, Annals of Discrete Math.**17**, North-Holland, Amsterdam, 1983.Google Scholar - [NP]A. Nakayama and B. Peroche,
*Linear arboricity of digraphs*, Networks**17**(1987), 39–53.zbMATHCrossRefMathSciNetGoogle Scholar - [P]B. Peroche,
*On partition of graphs into linear forests and dissections*, preprint.Google Scholar - [Pe]J. Petersen,
*Die Theorie der regulären Graphs*, Acta Math.**15**(1891), 193–220.CrossRefMathSciNetGoogle Scholar - [S]J. Spencer,
*Ten Lectures on the Probabilistic Method*, SIAM, Philadelphia, 1987, pp. 61–62.zbMATHGoogle Scholar - [T]P. Tomasta,
*Note on linear arboricity*, Math. Slovaca**32**(1982), 239–242.zbMATHMathSciNetGoogle Scholar - [V]V. Vizing,
*On an estimate of the chromatic class of a p graph*, Diskret Analiz.**3**(1964), 25–30.MathSciNetGoogle Scholar