Presents criteria for edge polytopes to possess regular unimodular triangulations, indicating important geometric properties of finite graphs.
In this paper, we give several criteria for the edge polytope of a graph to possess a regular unimodular triangulation in terms of some simple data of the graph.We further apply our criteria to several examples of graphs and show that their edge polytopes possess a regular unimodular triangulation.
No takes yet. Share an insight, caveat, or question.
Hamano Ginji (2016) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: