How to Cut All Edges of a Polytope.
WASHINGTON UNIV SEATTLE DEPT OF MATHEMATICS
Pagination or Media Count:
A survey of mutually related problems, conjectures and results is presented, dealing with variants of the notion of the cut-number mP of a polytope P . Here mP is the least number of hyperplanes needed to intersect all edges of the polytopes P . Cut-numbers and similar notions are of interest in many contexts, ranging from pattern recognition through graph theory to functional analysis. Author
- Operations Research