Decomposing 8-regular graphs into paths of length 4

Fábio Botler, Alexandre Talon

A $T$-decomposition of a graph $G$ is a set of edge-disjoint copies of $T$ in $G$ that cover the edge set of $G$. Graham and Häggkvist (1989) conjectured that any $2\ell$-regular g…