Journal article
A proof of the Barát-Thomassen conjecture
In
Journal of Combinatorial Theory. Series B
—
2017, Volume 124, pp. 39-55
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.
| Language: | English |
|---|---|
| Year: | 2017 |
| Pages: | 39-55 |
| ISSN: | 10960902 and 00958956 |
| Types: | Journal article |
| DOI: | 10.1016/j.jctb.2016.12.006 |
| ORCIDs: | Merker, Martin |
Other keywords
