How to Cut All Edges of a Polytope.

reportActive / Technical Report | Accession Number: AD0741694 | Need Help?

Abstract:

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

Author(s):
Gruenbaum, Branko
Author Organization(s):
WASHINGTON UNIV SEATTLE DEPT OF MATHEMATICS
Descriptive Note:
Technical rept.,
Pagination:
0011

Security Markings

DOCUMENT & CONTEXTUAL SUMMARY

Distribution:
Approved For Public Release

RECORD

Collection: TR
Identifying Numbers
Report Number(s):
TR-33
Contract/Grant Number(s):
N00014-67-A-0103-0003
Project Number(s):
NR-044-353
 Subject Terms
Communities of Interest:
No COI(s) Identified
Descriptor(s):
(*CONVEX SETS, GRAPHICS), TOPOLOGY, PATTERN RECOGNITION, FUNCTIONAL ANALYSIS
Field(s)/Group(s):
Operations Research
Keyword(s):
*POLYTOPES, GRAPHS
Report Date:
1972 Apr 01