Root polytopes and Jaeger‐type dissections for directed graphs
From MaRDI portal
Publication:6074977
DOI10.1112/mtk.12163zbMath1521.05057arXiv2105.00960OpenAlexW3158115740MaRDI QIDQ6074977
Tamás Kálmán, Lilla Tóthmérész
Publication date: 20 September 2023
Published in: Mathematika (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.00960
Graph polynomials (05C31) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Directed graphs (digraphs), tournaments (05C20) Shellability for polytopes and polyhedra (52B22) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Chip-firing game and a partial Tutte polynomial for Eulerian digraphs
- Biased graphs. I: Bias, balance, and gains
- A combinatorial model for the homfly polynomial
- A characterization of the Tutte polynomial via combinatorial embeddings
- Integer points in polyhedra
- Tutte polynomial, subgraphs, orientations and sandpile model: new connections via embeddings
- Homotopy properties of greedoids
- Signed graphs
- Normal polytopes arising from finite graphs
- Abelian sandpile model and Biggs-Merino polynomial for directed graphs
- Hypergraph polynomials and the Bernardi process
- Root polytopes, parking functions, and the HOMFLY polynomial
- A version of Tutte's polynomial for hypergraphs
- Interior polynomial for signed bipartite graphs and the HOMFLY polynomial
- Permutohedra, Associahedra, and Beyond
- Faces of Root Polytopes
- Root polytopes, Tutte polynomials, and a duality theorem for bipartite graphs
- ARITHMETIC ASPECTS OF SYMMETRIC EDGE POLYTOPES
