Enumeration of extensions of the cycle matroid of a complete graph
Abstract
We prove that the number of single element extensions of M(Kn+1) is 2n n/2(1+o(1)). This is done using a characterization of extensions as "linear subclasses".
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.