a Mathematics Institute, Hungarian Academy of Science, Budapest, Hungary
b Department of Mathematical Sciences, University of Memphis, Winfield Dunn Bldg., RM 373, Memphis, TN 38152, USA
Abstract:
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.