Proof of a conjecture on graph polytope

[2409.11970] Proof of a conjecture on graph polytope Skip to main content Search Submit Donate Log in Search arXiv Press Enter to search · Advanced search Mathematics > Combinatorics arXiv:2409.11970 (math) [Submitted on 18 Sep 2024 ( v1 ), last revised 5 Dec 2025 (this version, v2)] Title: Proof of a conjecture on graph polytope Authors: Feihu Liu View a PDF of the paper titled Proof of a conjecture on graph polytope, by Feihu Liu View PDF HTML (experimental) Abstract: Graph polytopes arising from vertex-weighted graphs were first introduced by Bóna, Ju, and Yoshida. We prove a conjecture stating that for any simple connected graph, the numerator polynomial of the Ehrhart series of its graph polytope is palindromic, using Stanley's reciprocity theorem. Furthermore, we introduce hypergraph polytopes and establish that every simple, connected, unimodular hypergraph polytope is an integer polytope. Additionally, for simple connected uniform hypergraph polytopes, we demonstrate that the numerator polynomial of their Ehrhart series is palindromic. Comments: 11 pages, 4 figures Subjects: Combinatorics (math.CO) Cite as: arXiv:2409.11970 [math.CO] (or arXiv:2409.11970v2 [math.CO] for this version) https://doi.org/10.48550/arXiv.2409.11970 Focus to learn more arXiv-issued DOI via DataCite Related DOI : https://doi.org/10.1016/j.dam.2025.12.034 Focus to learn more DOI(s) linking to related resources Submission history From: FeiHu Liu [ view email ] [v1] Wed, 18 Sep 2024 13:21:00 UTC (70 KB) [v2] Fri, 5 Dec 2025 12:30:37 UTC (217 KB) Full-text links: Access Paper: View a PDF of the paper titled Proof of a conjecture on graph polytope, by Feihu Liu View PDF HTML (experimental) TeX Source view license Current browse context: math.CO < prev | next > new | recent | 2024-09 Change to browse by: math References & Citations NASA ADS Google Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer ( What is the Explorer? ) Connected Papers Toggle Connected Papers ( What is Connected Papers? ) Litmaps Toggle Litmaps ( What is Litmaps? ) scite.ai Toggle scite Smart Citations ( What are Smart Citations? ) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv ( What is alphaXiv? ) Links to Code Toggle CatalyzeX Code Finder for Papers ( What is CatalyzeX? ) DagsHub Toggle DagsHub ( What is DagsHub? ) GotitPub Toggle Gotit.pub ( What is GotitPub? ) Huggingface Toggle Hugging Face ( What is Huggingface? ) ScienceCast Toggle ScienceCast ( What is ScienceCast? ) Demos Demos Replicate Toggle Replicate ( What is Replicate? ) Spaces Toggle Hugging Face Spaces ( What is Spaces? ) Spaces Toggle TXYZ.AI ( What is TXYZ.AI? ) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower ( What are Influence Flowers? ) Core recommender toggle CORE Recommender ( What is CORE? ) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs . Which authors of this paper are endorsers? | Disable MathJax ( What is MathJax? ) We gratefully acknowledge support from our major funders , member institutions , , and all contributors. About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab) Major funding support from

Related documents

• A proof of Bickle's conjecture on collapsible graphs#616780
• A proof of Bickle's conjecture on collapsible graphs#616280
• A Complete Proof of the Strong Conjecture about $F$-Irregular Graphs#1013843
• Beyond Sendov's conjecture: the quadratic Tang--Zhang inequality#1013331
• Confirmation of the Daykin-Frankl Conjecture#925452