Degrees of interior polynomials and parking function enumerators
From MaRDI portal
Cites work
- A geometric proof for the root-independence of the greedoid polynomial of Eulerian branching greedoids
- A Minimax Theorem for Directed Graphs
- A version of Tutte's polynomial for hypergraphs
- Abelian sandpile model and Biggs-Merino polynomial for directed graphs
- Arithmetic aspects of symmetric edge polytopes
- Chip-firing game and a partial Tutte polynomial for Eulerian digraphs
- Computing the Continuous Discretely
- Connections in combinatorial optimization
- Faces of directed edge polytopes
- Geometric bijections for regular matroids, zonotopes, and Ehrhart theory
- Homotopy properties of greedoids
- scientific article; zbMATH DE number 3742601 (Why is no real title available?)
- Multiples of lattice polytopes without interior lattice points
- On a generalization of symmetric edge polytopes to regular matroids
- Oriented Matroids
- Root polytopes and Jaeger‐type dissections for directed graphs
- Root polytopes, Tutte polynomials, and a duality theorem for bipartite graphs
- Smooth Fano polytopes arising from finite directed graphs
- Trees, parking functions, syzygies, and deformations of monomial ideals
- Universal Tutte polynomial
Cited in
(2)
This page was built for publication: Degrees of interior polynomials and parking function enumerators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6994541)
