A note on graphs without short even cycles

الأصل · EN

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