Enumeration of extensions of the cycle matroid of a complete graph.

We prove that the number of single element extensions of $M(K_{n+1})$ is $2^{{n\choose n/2}(1+o(1))}$. This is done using a characterization of extensions as "linear subclasses".