Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Biermann et al. (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: