Extremal numbers of cycles revisited

Abstract

We give a simple geometric interpretation of an algebraic construction of Wenger that yields $n$-vertex graphs with no cycle of length $4$, $6$ or $10$ and close to the maximum number of edges.

4 pages, to appear in Amer. Math. Monthly