Accession Number : AD0751686

Title :   Polygons in Arrangements Generated by n Points.

Descriptive Note : Technical rept.,

Corporate Author : WASHINGTON UNIV SEATTLE DEPT OF MATHEMATICS

Personal Author(s) : Gruenbaum,Branko

Report Date : OCT 1972

Pagination or Media Count : 13

Abstract : Generalizing a result of Sklyarskii-Cencov-Yaglom concerning partitions of a convex polygon by its diagonals, the following theorem is established: If F is a polygonal face of the arrangement generated in the plane by m points, then the number of sides of F is at most m if m is odd, and at most m-1 if m is even; both bounds are best possible. (Author)

Descriptors :   (*PROJECTIVE GEOMETRY, THEOREMS), GRAPHICS, MATHEMATICAL LOGIC, COMBINATORIAL ANALYSIS, INEQUALITIES

Subject Categories : Theoretical Mathematics

Distribution Statement : APPROVED FOR PUBLIC RELEASE