A note on graphs without short even cycles (Q1773215)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on graphs without short even cycles |
scientific article |
Statements
A note on graphs without short even cycles (English)
0 references
25 April 2005
0 references
Summary: We show that any \(n\)-vertex graph without even cycles of length at most \(2k\) has at most \({1\over2}n^{1 + 1/k} + O(n)\) edges, and polarity graphs of generalized polygons show that this is asymptotically tight when \(k \in \{2,3,5\}\).
0 references
polarity graphs
0 references
polygons
0 references
