arXiv · 2611.13580
The minimum number of cycles of length $0$ modulo $k$ in graphs with no proper $k$-coloring
Abstract
Consider an integer $k\geq 3$. Toft and Tuza observed that every graph with no proper $k$-coloring has a cycle of length $0$ modulo $k$. Brewster, McGuinness, Moore, and Noel conjectured the following quantitative strengthening: every graph with no proper $k$-coloring has at least $\frac{(k+1)!}{2k}$ cycles whose lengths are divisible by $k$. The conjecture is sharp, as demonstrated by the complete graph on $k+1$ vertices. Kim and Picollelli confirmed the conjecture for $k=3$. We establish the conjecture for every $k\geq 3$. In other words, we determine the minimum number of cycles of length $0$ modulo $k$ in a graph with no proper $k$-coloring.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Ilkyoo Choi, Kamil Sieniawski. 2026-11-10. The minimum number of cycles of length $0$ modulo $k$ in graphs with no proper $k$-coloring. https://searcharxiv.com/abs/2611.13580
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.