On decomposition thresholds for odd-length cycles and other tripartite graphs

Darryn Bryant, Peter Dukes, Daniel Horsley +2

An (edge) decomposition of a graph $G$ is a set of subgraphs of $G$ whose edge sets partition the edge set of $G$. Here we show, for each odd $\ell \ge 5$, that any graph $G$ of s…