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):

Report Date:

1972-04-01

Pagination or Media Count:

11.0

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

Subject Categories:

  • Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE