A note on graphs without short even cycles
classification
🧮 math.CO
keywords
cyclesevengraphswithoutasymptoticallyedgesgeneralizedgraph
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.