Proof of a conjecture on graph polytope

DOI10.1016/J.DAM.2025.12.034MaRDI QIDQ6854643zbMATH OpenFDO

Authors Feihu Liu

Publication date 24 February 2026

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2025.12.034

zbMATH Keywords

Ehrhart seriesgraph polytopehypergraph polytopepalindromic polynomial

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Signed and weighted graphs (05C22) Hypergraphs (05C65) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05)

Cites work

• A Euclid style algorithm for MacMahon's partition analysis
• Combinatorial reciprocity theorems
• Computing the Continuous Discretely
• Counting integer flows in networks
• Decompositions of Rational Convex Polytopes
• Different Volume Computation Methods of Graph Polytopes
• Effective lattice point counting in rational convex polytopes
• Enumerating solutions of a system of linear inequalities related to magic squares
• ENUMERATION OF WEIGHTED COMPLETE GRAPHS
• Generalization of Stanley's monster reciprocity theorem
• scientific article; zbMATH DE number 6016068 (Why is no real title available?)
• scientific article; zbMATH DE number 3163858 (Why is no real title available?)
• scientific article; zbMATH DE number 1234104 (Why is no real title available?)
• Hypergraph theory. An introduction
• Lectures on Polytopes
• Linear homogeneous Diophantine equations and magic labelings of graphs
• On the enumeration of certain weighted graphs
• Proving some conjectures on Kekulé numbers for certain benzenoids by using Chebyshev polynomials

This page was built for publication: Proof of a conjecture on graph polytope

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6854643)