arXiv · 2611.17047
Integer Decomposition Property of Edge Polytopes of Weighted Oriented Graphs
Abstract
We classify the lattice polytopes arising from vertex-weighted oriented graphs that have the integer decomposition property (IDP). Allowing vertex weights and edge orientations introduces non-vertex lattice points in the polytope which need to be accounted for when studying the IDP. We can then identify forbidden induced subgraphs in the sense that their presence obstructs the IDP for the supergraph. We establish positive results for several families of graphs under suitable orientation and coprimality conditions, including weighted oriented paths and cycles, and show that any weighted oriented tree with a unique sink has the IDP.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Jennifer Biermann, Kuei-Nuan Lin, Augustine O'Keefe. 2026-11-12. Integer Decomposition Property of Edge Polytopes of Weighted Oriented Graphs. https://searcharxiv.com/abs/2611.17047
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.