Prefer a chat interface with context about you and your work?
The longest cycle of a graph with a large minimal degree
Abstract We show that every graph G on n vertices with minimal degree at least n/k contains a cycle of length at least [ n /( k − 1)]. This verifies a conjecture of Katchalski. When k = 2 our result reduces to the classical theorem of Dirac that asserts …