Connectivity gaps among matroids with the same enumerative invariants
DOI10.1016/J.AAM.2023.102648zbMATH Open1530.05023arXiv2308.02302MaRDI QIDQ6138046FDOQ6138046
Author name not available (Why is that?)
Publication date: 16 January 2024
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2308.02302
Graph polynomials (05C31) 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) Enumeration in graph theory (05C30) Connectivity (05C40)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Base-sortable matroids and Koszulness of semigroup rings
- A unique factorization theorem for matroids
- An Affine Representation for Transversal Geometries
- The \(\mathcal{G}\)-invariant and catenary data of a matroid
- Symmetric and quasi-symmetric functions associated to polymatroids
- The lattice of cyclic flats of a matroid
- Tangles, tree-decompositions and grids in matroids
- Positroids and Schubert matroids
- Lattice path matroids: Enumerative aspects and Tutte polynomials
- Multi-Path Matroids
- Positroids and non-crossing partitions
- Characterizations of transversal and fundamental transversal matroids
- The free product of matroids
- Computing the Tutte polynomial of a matroid from its lattice of cyclic flats
- Obstructions to branch-decomposition of matroids
- A characterization of tangle matroids
Cited In (1)
This page was built for publication: Connectivity gaps among matroids with the same enumerative invariants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6138046)