PQ-type adjacency polytopes of join graphs

DOI10.1007/s00454-022-00447-zzbMath1516.05106arXiv2103.15045OpenAlexW4307404224MaRDI QIDQ6156092

Akiyoshi Tsuchiya, Hidefumi Ohsugi

Publication date: 12 June 2023

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

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

zbMATH Keywords

root polytopejoin graphinterior polynomial\(h^\ast\)-polynomialadjacency polytopeperfectly matchable set

Mathematics Subject Classification ID

Graph polynomials (05C31) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20)

Related Items

Toric rings of perfectly matchable subgraph polytopes

Cites Work

• Unnamed Item
• The perfectly matchable subgraph polytope of an arbitrary graph
• Polynômes arithmétiques et méthode des polyedres en combinatoire
• The \(h^\ast\)-polynomials of locally anti-blocking lattice polytopes and their \(\gamma\)-positivity
• Computing volumes of adjacency polytopes via Draconian sequences
• Many faces of symmetric edge polytopes
• Reflexive polytopes arising from bipartite graphs with \(\gamma\)-positivity associated to interior polynomials
• A version of Tutte's polynomial for hypergraphs
• The perfectly matchable subgraph polytope of a bipartite graph
• Root Polytopes and Growth Series of Root Lattices
• Permutohedra, Associahedra, and Beyond
• Counting Equilibria of the Kuramoto Model Using Birationally Invariant Intersection Index
• Symmetric edge polytopes and matching generating polynomials
• Computing the Continuous Discretely
• Root polytopes, Tutte polynomials, and a duality theorem for bipartite graphs
• ARITHMETIC ASPECTS OF SYMMETRIC EDGE POLYTOPES