Papers
Topics
Authors
Recent
Search
2000 character limit reached

Minimum degree conditions for the existence of cycles of all lengths modulo $k$ in graphs

Published 8 Apr 2019 in math.CO | (1904.03818v1)

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.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (2)

  1. Shuya Chiba 
  2. Tomoki Yamashita 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up