{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T08:45:28Z","timestamp":1773823528894,"version":"3.50.1"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T00:00:00Z","timestamp":1685577600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,6,13]],"date-time":"2023-06-13T00:00:00Z","timestamp":1686614400000},"content-version":"vor","delay-in-days":12,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2023,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In 1980, Akiyama, Exoo and Harary posited the Linear Arboricity Conjecture which states that any graph <jats:italic>G<\/jats:italic> of maximum degree <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\Delta $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>\u0394<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> can be decomposed into at most \"Equation missing\" linear forests. (A forest is linear if all of its components are paths.) In 1988, Alon proved the conjecture holds asymptotically. The current best bound is due to Ferber, Fox and Jain from 2020 who showed that <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\frac{\\Delta }{2}+ O(\\Delta ^{0.661})$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mfrac>\n                      <mml:mi>\u0394<\/mml:mi>\n                      <mml:mn>2<\/mml:mn>\n                    <\/mml:mfrac>\n                    <mml:mo>+<\/mml:mo>\n                    <mml:mi>O<\/mml:mi>\n                    <mml:mrow>\n                      <mml:mo>(<\/mml:mo>\n                      <mml:msup>\n                        <mml:mi>\u0394<\/mml:mi>\n                        <mml:mrow>\n                          <mml:mn>0.661<\/mml:mn>\n                        <\/mml:mrow>\n                      <\/mml:msup>\n                      <mml:mo>)<\/mml:mo>\n                    <\/mml:mrow>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> suffices for large enough <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\Delta $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>\u0394<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. Here, we show that <jats:italic>G<\/jats:italic> admits a decomposition into at most <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\frac{\\Delta }{2}+ 3\\sqrt{\\Delta } \\log ^4 \\Delta $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mfrac>\n                      <mml:mi>\u0394<\/mml:mi>\n                      <mml:mn>2<\/mml:mn>\n                    <\/mml:mfrac>\n                    <mml:mo>+<\/mml:mo>\n                    <mml:mn>3<\/mml:mn>\n                    <mml:msqrt>\n                      <mml:mi>\u0394<\/mml:mi>\n                    <\/mml:msqrt>\n                    <mml:msup>\n                      <mml:mo>log<\/mml:mo>\n                      <mml:mn>4<\/mml:mn>\n                    <\/mml:msup>\n                    <mml:mi>\u0394<\/mml:mi>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> linear forests provided <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\Delta $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>\u0394<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> is large enough. Moreover, our result also holds in the more general list setting, where edges have (possibly different) sets of permissible linear forests. Thus our bound also holds for the List Linear Arboricity Conjecture which was only recently shown to hold asymptotically by Kim and the second author. Indeed, our proof method ties together the Linear Arboricity Conjecture and the well-known List Colouring Conjecture; consequently, our error term for the Linear Arboricity Conjecture matches the best known error-term for the List Colouring Conjecture due to Molloy and Reed from 2000. This follows as we make two copies of every colour and then seek a proper edge colouring where we avoid bicoloured cycles between a colour and its copy; we achieve this via a clever modification of the nibble method.<\/jats:p>","DOI":"10.1007\/s00493-023-00024-9","type":"journal-article","created":{"date-parts":[[2023,6,13]],"date-time":"2023-06-13T08:02:14Z","timestamp":1686643334000},"page":"547-569","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["An Improved Bound for the Linear Arboricity Conjecture"],"prefix":"10.1007","volume":"43","author":[{"given":"Richard","family":"Lang","sequence":"first","affiliation":[]},{"given":"Luke","family":"Postle","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,13]]},"reference":[{"issue":"4","key":"24_CR1","first-page":"405","volume":"30","author":"J Akiyama","year":"1980","unstructured":"Akiyama, J., Exoo, G., Harary, F.: Covering and packing in graphs. III: cyclic and acyclic invariants. Math. Slovaca 30(4), 405\u2013417 (1980)","journal-title":"Math. Slovaca"},{"issue":"3","key":"24_CR2","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/BF02783300","volume":"62","author":"N Alon","year":"1988","unstructured":"Alon, N.: The linear arboricity of graphs. Isr. J. Math. 62(3), 311\u2013325 (1988)","journal-title":"Isr. J. Math."},{"key":"24_CR3","first-page":"1","volume":"187","author":"N Alon","year":"1993","unstructured":"Alon, N.: Restricted colorings of graphs. Surv. Comb. 187, 1\u201333 (1993)","journal-title":"Surv. Comb."},{"key":"24_CR4","volume-title":"The Probabilistic Method","author":"N Alon","year":"2016","unstructured":"Alon, N., Spencer, J.H.: The Probabilistic Method. Wiley, Hoboken (2016)"},{"issue":"3","key":"24_CR5","doi-asserted-by":"publisher","first-page":"499","DOI":"10.7151\/dmgt.1460","volume":"29","author":"X An","year":"2009","unstructured":"An, X., Wu, B.: The list linear arboricity of planar graphs. Discuss. Math. Graph Theory 29(3), 499\u2013510 (2009)","journal-title":"Discuss. Math. Graph Theory"},{"key":"24_CR6","unstructured":"Erd\u0151s, P., Lov\u00e1sz, L.: Problems and results on finite and infinite graphs. In: Recent Advances in Graph Theory (Proceedings of the Second Czechoslovak Symposium, Prague, 1974), pp. 183\u2013192 (1975)"},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.jctb.2019.08.009","volume":"142","author":"A Ferber","year":"2020","unstructured":"Ferber, A., Fox, J., Jain, V.: Towards the linear arboricity conjecture. J. Comb. Theory B 142, 56\u201379 (2020)","journal-title":"J. Comb. Theory B"},{"issue":"1","key":"24_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jcta.1996.0001","volume":"73","author":"J Kahn","year":"1996","unstructured":"Kahn, J.: Asymptotically good list-colorings. J. Comb. Theory A 73(1), 1\u201359 (1996)","journal-title":"J. Comb. Theory A"},{"issue":"1","key":"24_CR9","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1002\/jgt.22685","volume":"98","author":"R Kim","year":"2021","unstructured":"Kim, R., Postle, L.: The list linear arboricity of graphs. J. Graph Theory 98(1), 125\u2013140 (2021)","journal-title":"J. Graph Theory"},{"issue":"3\u20134","key":"24_CR10","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1002\/1098-2418(200010\/12)17:3\/4<376::AID-RSA10>3.0.CO;2-0","volume":"17","author":"M Molloy","year":"2000","unstructured":"Molloy, M., Reed, B.: Near-optimal list colorings. Random Struct. Algorithms 17(3\u20134), 376\u2013402 (2000)","journal-title":"Random Struct. Algorithms"},{"key":"24_CR11","volume-title":"Graph Colouring and the Probabilistic Method","author":"M Molloy","year":"2013","unstructured":"Molloy, M., Reed, B.: Graph Colouring and the Probabilistic Method, vol. 23. Springer, Berlin (2013)"},{"issue":"1","key":"24_CR12","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BF02699376","volume":"81","author":"M Talagrand","year":"1995","unstructured":"Talagrand, M.: Concentration of measure and isoperimetric inequalities in product spaces. Publ. math. IH\u00c9S 81(1), 73\u2013205 (1995)","journal-title":"Publ. math. IH\u00c9S"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-023-00024-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-023-00024-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-023-00024-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,18]],"date-time":"2023-08-18T12:06:25Z","timestamp":1692360385000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-023-00024-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["24"],"URL":"https:\/\/doi.org\/10.1007\/s00493-023-00024-9","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6]]},"assertion":[{"value":"4 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 December 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 January 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 June 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}