Minimum degree conditions for the existence of cycles of all lengths modulo k in graphs
classification
🧮 math.CO
keywords
cyclesdegreelengthsminimummoduloaffirmativelyconditionsconjecture
read the original abstract
Thomassen, in 1983, conjectured that for a positive integer $k$, every $2$-connected non-bipartite graph of minimum degree at least $k + 1$ contains cycles of all lengths modulo $k$. In this paper, we settle this conjecture affirmatively.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.