Small Min-Cut Polyhedra
研究了有向和无向完全图的小最小割多面体，给出了节点数不超过七的无向图和不超过五的有向图的理想描述，并推广到任意节点数的完全图，发现其面结构异常丰富。
We study small min-cut polyhedra for directed and undirected complete graphs. We give the ideal descriptions of the polyhedra for undirected graphs with up to seven nodes and for directed graphs with up to five nodes, and generalize the inequalities for complete graphs with arbitrary number of nodes. The facial structure of the polyhedra turns out to be unexpectedly rich.