Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5777620 | Journal of Combinatorial Theory, Series B | 2017 | 17 Pages |
Abstract
The Barát-Thomassen conjecture asserts that for every tree T on m edges, there exists a constant kT such that every kT-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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Julien Bensmail, Ararat Harutyunyan, Tien-Nam Le, Martin Merker, Stéphan Thomassé,