arXiv · 1706.02516
Generalized cut and metric polytopes of graphs and simplicial complexes
Abstract
Given a graph $G$ one can define the cut polytope CUTP(G) and the metric polytope METP(G) of this graph and those polytopes encode in a nice way the metric on the graph. According to Seymour's theorem, CUTP(G) = METP(G) if and only if K_5 is not a minor of G. We consider possibly extensions of this framework: a) We compute the CUTP(G) and METP(G) for many graphs. b) We define the oriented cut polytope WOMCUTP(G) and oriented multicut polytope OMCUTP(G) as well as their oriented metric version QMETP(G) and WQMETP(G). c) We define an $n$-dimensional generalization of metric on simplicial complexes.
Explore related subjects
Keep this discovery
Michel Deza, Mathieu Dutour Sikirić. 2017-06-08. Generalized cut and metric polytopes of graphs and simplicial complexes. https://arxiv.org/abs/1706.02516
Cite the original work for its findings. Save a collection to share your selection of sources.