A proof of the Barát-Thomassen conjecture

Publication: Research - peer-reviewJournal article – Annual report year: 2017

DOI

View graph of relations

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.
Original languageEnglish
JournalJournal of Combinatorial Theory. Series B
Volume124
Pages (from-to)39-55
ISSN0095-8956
DOIs
StatePublished - 2017
CitationsWeb of Science® Times Cited: 0

    Keywords

  • Barát-Thomassen conjecture, Large edge-connectivity, Tree-decomposition
Download as:
Download as PDF
Select render style:
APAAuthorCBE/CSEHarvardMLAStandardVancouverShortLong
PDF
Download as HTML
Select render style:
APAAuthorCBE/CSEHarvardMLAStandardVancouverShortLong
HTML
Download as Word
Select render style:
APAAuthorCBE/CSEHarvardMLAStandardVancouverShortLong
Word

ID: 128495149