A note on graphs without short even cycles

Details A note on graphs without short even cycles A note on graphs without short even cycles

2005-03-28

arxiv.org/abs/math/0503623v1

Mathematics

Combinatorics

6 pages

Scientific paper

We show that any n-vertex graph without even cycles of length at most 2k has
at most 1/2(n^{1 + 1/k}) + O(n) edges, and polarity graphs of generalized
polygons show that this is asymptotically tight when k = 2,3,5.

Affiliated with

Also associated with

No associations

Rating

A note on graphs without short even cycles 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 A note on graphs without short even cycles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A note on graphs without short even cycles will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-599181