Graphs with no 2δ + 1 cycle
Abstract
Dirac proved that any graph with minimum vertex degree δ contains either a cycle of length at least 2δ or a Hamilton cycle. Motivated by this result, we characterize those graphs having no cycle longer than 2δ.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.