Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture

Abstract : In 2006, Barát and Thomassen conjectured that there is a function f such that, for every fixed tree T with t edges, every f(t)-edge-connected graph with its number of edges divisible by t has a partition of its edges into copies of T. This conjecture was recently verified by the current authors and Merker. We here further focus on the path case of the Barát-Thomassen conjecture. Before the aforementioned general proof was announced, several successive steps towards the path case of the conjecture were made, notably by Thomassen, until this particular case was totally solved by Botler, Mota, Oshiro and Wakabayashi. Our goal in this paper is to propose an alternative proof of the path case with a weaker hypothesis: Namely, we prove that there is a function f such that every 24-edge-connected graph with minimum degree f(t) has an edge-partition into paths of length t whenever t divides the number of edges. We also show that 24 can be dropped to 4 when the graph is eulerian.
Type de document :
Article dans une revue
Combinatorica, Springer Verlag, In press
Liste complète des métadonnées

Littérature citée [13 références]  Voir  Masquer  Télécharger

Contributeur : Julien Bensmail <>
Soumis le : mardi 27 mars 2018 - 14:28:55
Dernière modification le : vendredi 30 mars 2018 - 01:29:48


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-01744515, version 1



Julien Bensmail, Ararat Harutyunyan, Tien-Nam Le, Stéphan Thomassé. Edge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture. Combinatorica, Springer Verlag, In press. 〈hal-01744515〉



Consultations de la notice


Téléchargements de fichiers