Enumeration of extensions of the cycle matroid of a complete graph
From MaRDI portal
Publication:2133994
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Asymptotic enumeration (05A16) Combinatorial aspects of matroids and geometric lattices (05B35)
Recommendations
Cites work
- scientific article; zbMATH DE number 5873618 (Why is no real title available?)
- Almost all matroids are nonrepresentable
- Biased graphs. I: Bias, balance, and gains
- Biased graphs. II: The three matroids
- Biased graphs. III: Chromatic and dichromatic invariants
- Growth rates of minor-closed classes of matroids
- On Dedekind's Problem: The Number of Monotone Boolean Functions
- On the number of biased graphs
- Single-element extensions of matroids
- The asymptotic number of geometries
- The highly connected matroids in minor-closed classes
- Varieties of Combinatorial Geometries
Cited in
(2)
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)