Enumeration of extensions of the cycle matroid of a complete graph

From MaRDI portal
Publication:2133994




Abstract: We prove that the number of single element extensions of M(Kn+1) is 2nchoosen/2(1+o(1)). This is done using a characterization of extensions as "linear subclasses".









This page was built for publication: Enumeration of extensions of the cycle matroid of a complete graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2133994)