On decomposition thresholds for odd-length cycles and other tripartite graphs (2411.17232v1)

Abstract: 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 \geq 5$, that any graph $G$ of sufficiently large order $n$ with minimum degree at least $(\frac{1}{2}+\frac{1}{2\ell-4}+o(1))n$ has a decomposition into $\ell$-cycles if and only if $\ell$ divides $|E(G)|$ and each vertex of $G$ has even degree. This threshold cannot be improved beyond $\frac{1}{2}+\frac{1}{2\ell-2}$. It was previously shown that the thresholds approach $\frac{1}{2}$ as $\ell$ becomes large, but our thresholds do so significantly more rapidly. Our methods can be applied to tripartite graphs more generally and we also obtain some bounds for decomposition thresholds of other tripartite graphs.