Skip to Main content Skip to Navigation
Journal articles

A Proof of the Barát–Thomassen Conjecture

Abstract : The Barát-Thomassen conjecture asserts that for every tree T on m edges, there exists a constant k T such that every k T-edge-connected graph with size divisible by m can be edge-decomposed into copies of T. So far this conjecture has only been verified when T is a path or when T has diameter at most 4. Here we prove the full statement of the conjecture.
Document type :
Journal articles
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download
Contributor : Julien Bensmail <>
Submitted on : Tuesday, November 7, 2017 - 7:58:53 AM
Last modification on : Wednesday, October 14, 2020 - 4:22:50 AM
Long-term archiving on: : Thursday, February 8, 2018 - 12:33:26 PM


Files produced by the author(s)



Julien Bensmail, Ararat Harutyunyan, Tien-Nam Le, Martin Merker, Stéphan Thomassé. A Proof of the Barát–Thomassen Conjecture. Journal of Combinatorial Theory, Series B, Elsevier, 2017, 124, pp.39 - 55. ⟨10.1016/j.jctb.2016.12.006⟩. ⟨hal-01629943⟩



Record views


Files downloads