A Note on Graphs Without Short Even Cycles
Thomas Lam, Jacques Verstraëte · The Electronic Journal of Combinatorics · 2005
Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.
The Electronic Journal of Combinatorics · Electronic Journal of Combinatorics · article · 2005
Abstract
In this note, 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\}$.
Open the resolved locator · 10.37236/1972
Metadata licence: OpenAlex metadata (CC0)