Enumeration of extensions of the cycle matroid of a complete graph
DOI10.1016/J.AAM.2022.102343zbMATH Open1487.05047arXiv2111.06585OpenAlexW4220965604MaRDI QIDQ2133994FDOQ2133994
Authors: Yanyan Li
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
Recommendations
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)
Cites Work
- Biased graphs. III: Chromatic and dichromatic invariants
- Title not available (Why is that?)
- Biased graphs. I: Bias, balance, and gains
- Biased graphs. II: The three matroids
- On Dedekind's Problem: The Number of Monotone Boolean Functions
- Growth rates of minor-closed classes of matroids
- The highly connected matroids in minor-closed classes
- Varieties of Combinatorial Geometries
- The asymptotic number of geometries
- Single-element extensions of matroids
- On the number of biased graphs
- Almost all matroids are nonrepresentable
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)