Paperlane

no. 17 · Wednesday 18 November 2026

Gallai's path decomposition conjecture for $K_5$-minor-free graphs

Junhao Zhang, Qinghai Liu and Yanmei Hong

math.CO · 21 pp

Abstract

Gallai conjectured that the edges of every connected graph on $n$ vertices can be partitioned into at most $\ceil{n/2}$ paths. We prove that every connected $K_5$-minor-free graph other than $K_3$ and $K_5-e$ admits such a partition into at most $\floor{n/2}$ paths. The two exceptions require $\ceil{n/2}$ paths. In a smallest counterexample we find a $4$-connected planar part containing four vertices of degree five. Their neighborhoods meet the boundary in at most one vertex. This allows us to apply the planar configurations of Blanché, Bonamy, and Bonichon and to realize the reduced graph as a minor of the original graph.

comments
21 pages,5 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.21673 ↗