The Tutte polynomial via lattice point counting
From MaRDI portal
Publication:2077269
DOI10.1016/j.jcta.2021.105584zbMath1483.05084arXiv1802.09859OpenAlexW4205169796MaRDI QIDQ2077269
Publication date: 24 February 2022
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1802.09859
Graph polynomials (05C31) Exact enumeration problems, generating functions (05A15) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items (6)
Universal Tutte polynomial ⋮ A non-associative incidence near-ring with a generalized Möbius function ⋮ On the polymatroid Tutte polynomial ⋮ Tautological classes of matroids ⋮ Classical algebraic geometry. Abstracts from the workshop held June 20--26, 2021 (hybrid meeting) ⋮ Flag matroids: algebra and geometry
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalized permutohedra, \(h\)-vectors of cotransversal matroids and pure \(O\)-sequences
- \(K\)-classes for matroids and equivariant localization
- Triangulations. Structures for algorithms and applications
- A problem of P. Seymour on nonbinary matroids
- Lattice invariant valuations on rational polytopes
- Hopf algebras and Tutte polynomials
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Discrete polymatroids
- A version of Tutte's polynomial for hypergraphs
- Permutohedra, Associahedra, and Beyond
- Tropical Linear Spaces
- Greedy algorithm and symmetric matroids
- Root polytopes, Tutte polynomials, and a duality theorem for bipartite graphs
- Minimum partition of a matroid into independent subsets
This page was built for publication: The Tutte polynomial via lattice point counting