Accession Number : AD0741694

Title :   How to Cut All Edges of a Polytope.

Descriptive Note : Technical rept.,

Corporate Author : WASHINGTON UNIV SEATTLE DEPT OF MATHEMATICS

Personal Author(s) : Gruenbaum,Branko

Report Date : APR 1972

Pagination or Media Count : 11

Abstract : A survey of mutually related problems, conjectures and results is presented, dealing with variants of the notion of the cut-number m(P) of a polytope P . Here m(P) 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)

Descriptors :   (*CONVEX SETS, GRAPHICS), TOPOLOGY, PATTERN RECOGNITION, FUNCTIONAL ANALYSIS

Subject Categories : Operations Research

Distribution Statement : APPROVED FOR PUBLIC RELEASE