Enumeration of extensions of the cycle matroid of a complete graph
From MaRDI portal
Publication:2133994
DOI10.1016/j.aam.2022.102343zbMath1487.05047arXiv2111.06585OpenAlexW4220965604MaRDI QIDQ2133994
Publication date: 5 May 2022
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2111.06585
Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35) Asymptotic enumeration (05A16) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Biased graphs. I: Bias, balance, and gains
- Growth rates of minor-closed classes of matroids
- Biased graphs. II: The three matroids
- The asymptotic number of geometries
- Biased graphs. III: Chromatic and dichromatic invariants
- The highly connected matroids in minor-closed classes
- Varieties of Combinatorial Geometries
- On the Number of Biased Graphs
- Almost all matroids are nonrepresentable
- Single-element extensions of matroids
- On Dedekind's Problem: The Number of Monotone Boolean Functions
This page was built for publication: Enumeration of extensions of the cycle matroid of a complete graph
