The linear arboricity of graphs
 N. Alon
 … show all 1 hide
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
Alinear forest is a forest in which each connected component is a path. Thelinear arboricity la(G) of a graphG is the minimum number of linear forests whose union is the set of all edges ofG. Thelinear arboricity conjecture asserts that for every simple graphG 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 everyG with maximum degree Δ≧Δ_{0}. To do this, we first prove the conjecture for everyG with an even maximum degree Δ and withgirth g≧50Δ.
 J. Akiyama,A status on the linear arboricity, Lecture Notes in Comp. Science108, New York, 1981, pp. 38–44.
 I. Algor and N. Alon,The star arboricity of graphs, in preparation.
 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.
 H. AitDjafter,Linear arboricity for graphs with maximum degree six or seven and edgemultiplicity two, Ars Combinatoria20 (1985), 5–16.
 J. Akiyama, G. Exoo and F. Harary,Covering and packing in graphs III. Cyclic and acyclic invariants, Math. Slovaca30 (1980), 405–417.
 J. Akiyama, G. Exoo and F. Harary,Covering and packing in graphs IV. Linear arboricity, Networks11 (1981), 69–72. CrossRef
 J. Akiyama and M. Kano,Path factors of a graph, in:Graph Theory and its Applications, Wiley and Sons, New York, 1984.
 Y. Aoki,The star arboricity of the complete regular multipartite graphs, preprint.
 J. Akiyama and I. Saito,A comment on the linear arboricity for regular multigraphs, to appear.
 B. Bollobás,Random Graphs, Academic Press, London, 1985, p. 11.
 J. C. Bermond, J. L. Fouquet, M. Habib and B. Peroche,On linear karboricity, Discrete Math.43 (1984), 123–132. CrossRef
 J. A. Bondy and U. S. R. Murty,Graph Theory with Applications, Macmillan Press, London, 1976.
 H. Enomoto,The linear arboricity of 5regular graphs, Technical Report, Dept. of Information Sci., Univ. of Tokyo, 1981.
 P. Erdös and L. Lovász,Problems and results on 3chromatic hypergraphs and some related questions, inInfinite and Finite Sets (A. Hajnalet al., eds.), NorthHolland, Amsterdam, 1975, pp. 609–628.
 H. Enomoto and B. Peroche,The linear arboricity of some regular graphs, J. Graph Theory8 (1984), 309–324. CrossRef
 F. Guldan,The linear arboricity of 10regular graphs, Math. Slovaca36 (1986), 225–228.
 F. Guldan,Some results on linear arboricity, J. Graph Theory10 (1986), 505–509. CrossRef
 F. Harary,Covering and packing in graphs I., Ann. N.Y. Acad. Sci.175 (1970), 198–205.
 M. Habib and B. Peroche,Some problems about linear arboricity, Discrete Math.41 (1982), 219–220. CrossRef
 M. Habib and B. Peroche,La karboricité linéaire des arbres, inCombinatorial Mathematics, Annals of Discrete Math.17, NorthHolland, Amsterdam, 1983.
 A. Nakayama and B. Peroche,Linear arboricity of digraphs, Networks17 (1987), 39–53. CrossRef
 B. Peroche,On partition of graphs into linear forests and dissections, preprint.
 J. Petersen,Die Theorie der regulären Graphs, Acta Math.15 (1891), 193–220. CrossRef
 J. Spencer,Ten Lectures on the Probabilistic Method, SIAM, Philadelphia, 1987, pp. 61–62.
 P. Tomasta,Note on linear arboricity, Math. Slovaca32 (1982), 239–242.
 V. Vizing,On an estimate of the chromatic class of a p graph, Diskret Analiz.3 (1964), 25–30.
 Title
 The linear arboricity of graphs
 Journal

Israel Journal of Mathematics
Volume 62, Issue 3 , pp 311325
 Cover Date
 19881001
 DOI
 10.1007/BF02783300
 Print ISSN
 00212172
 Online ISSN
 15658511
 Publisher
 SpringerVerlag
 Additional Links
 Topics
 Industry Sectors
 Authors

 N. Alon ^{(1)}
 Author Affiliations

 1. Department of Mathematics, Sackler Faculty of Exact Sciences, Tel Aviv University, Ramat Aviv, Tel Aviv, Israel