The set of different cycle lengths of a graph G is denoted by C(G). We study how the distribution of C(G) depends on the minimum degree of G. We prove two results indicating that C(G) is dense in some sense. These results lead to the solution of a conjecture of Erdös and Hajnal stating that for suitable positive constants a, b the following holds: (Formula Presented.) where δ(G) denotes the minimum degree of G.
|Original language||English (US)|
|Number of pages||22|
|Journal||Journal of Graph Theory|
|State||Published - 1984|
All Science Journal Classification (ASJC) codes
- Geometry and Topology