A note on graphs without short even cycles
Combinatorics
2007-05-23 v1
Abstract
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.
Keywords
Cite
@article{arxiv.math/0503623,
title = {A note on graphs without short even cycles},
author = {Thomas Lam and Jacques Verstraete},
journal= {arXiv preprint arXiv:math/0503623},
year = {2007}
}
Comments
6 pages