Minimum degree conditions for the existence of cycles of all lengths modulo k in graphs
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.