Connectivity gaps among matroids with the same enumerative invariants
From MaRDI portal
Publication:6138046
DOI10.1016/j.aam.2023.102648zbMath1530.05023arXiv2308.02302MaRDI QIDQ6138046
No author found.
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) Enumeration in graph theory (05C30) Combinatorial aspects of matroids and geometric lattices (05B35) Connectivity (05C40)
Cites Work
- Unnamed Item
- Unnamed Item
- Characterizations of transversal and fundamental transversal matroids
- Positroids and Schubert matroids
- The \(\mathcal{G}\)-invariant and catenary data of a matroid
- Symmetric and quasi-symmetric functions associated to polymatroids
- Computing the Tutte polynomial of a matroid from its lattice of cyclic flats
- The lattice of cyclic flats of a matroid
- Tangles, tree-decompositions and grids in matroids
- Lattice path matroids: Enumerative aspects and Tutte polynomials
- A characterization of tangle matroids
- Obstructions to branch-decomposition of matroids
- The free product of matroids
- A unique factorization theorem for matroids
- Positroids and non-crossing partitions
- An Affine Representation for Transversal Geometries
- Multi-Path Matroids
- Base-sortable matroids and Koszulness of semigroup rings
