This paper determines lower bounds on the number of different cycle lengths in a graph of given minimum degree k and girth g. The most general result gives a lower bound of ckg/8.
- Cycle lengths
- Minimum degree
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics