\(h^*\) -vectors of graph polytopes using activities of dissecting spanning trees

DOI10.5802/alco.318arXiv2203.17127MaRDI QIDQ6119518

Tamás Kálmán, Lilla Tóthmérész

Publication date: 1 March 2024

Published in: Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2203.17127

zbMATH Keywords

activityroot polytopesymmetric edge polytope\(h^*\)-vectorspanning tree dissections

Mathematics Subject Classification ID

Graph polynomials (05C31) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20)

Cites Work

• Roots of Ehrhart polynomials arising from graphs
• A characterization of the Tutte polynomial via combinatorial embeddings
• Computing parametric rational generating functions with a primal Barvinok algorithm
• Tutte polynomial, subgraphs, orientations and sandpile model: new connections via embeddings
• Hypergraph polynomials and the Bernardi process
• The \(h^\ast\)-polynomials of locally anti-blocking lattice polytopes and their \(\gamma\)-positivity
• Many faces of symmetric edge polytopes
• Root polytopes, parking functions, and the HOMFLY polynomial
• Permutohedra, Associahedra, and Beyond
• Root polytopes, Tutte polynomials, and a duality theorem for bipartite graphs
• ARITHMETIC ASPECTS OF SYMMETRIC EDGE POLYTOPES
• A Contribution to the Theory of Chromatic Polynomials
• Root polytopes and Jaeger‐type dissections for directed graphs

This page was built for publication: \(h^*\) -vectors of graph polytopes using activities of dissecting spanning trees