Arithmetic Progressions of Cycle Lengths in Graphs

Details Arithmetic Progressions of Cycle Lengths in Graphs Arithmetic Progressions of Cycle Lengths in Graphs

2002-04-17

arxiv.org/abs/math/0204222v1

Combinatorics, Probability and Computing 9 (2000) No 4 369-373

Mathematics

Combinatorics

Scientific paper

A recently posed question of Haggkvist and Scott's asked whether or not there exists a constant c such that if G is a graph of minimum degree ck then G contains cycles of k consecutive even lengths. In this paper we answer the question by proving that for k > 1, a bipartite graph of average degree at least 4k and girth g contains cycles of (g/2-1)k consecutive even lengths. We also obtain a short proof of the theorem of Bondy and Simonovits, that a graph of order n and size at least 8(k-1)n^{1 + 1/k} has a cycle of length 2k.

Affiliated with

Also associated with

No associations

Rating

Arithmetic Progressions of Cycle Lengths in Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Arithmetic Progressions of Cycle Lengths in Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Arithmetic Progressions of Cycle Lengths in Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-358307