
Accession Number : AD0678318
Title : INTERSECTION PROPERTIES OF BOXES IN Rd.
Descriptive Note : Technical rept.,
Corporate Author : WASHINGTON UNIV SEATTLE DEPT OF MATHEMATICS
Personal Author(s) : Danzer,Ludwig ; Grunbaum,Branko
Report Date : SEP 1968
Pagination or Media Count : 21
Abstract : A family of sets is called npierceable if there exists a set of n points such that each member of the family contains at least one of the points. Helly's theorem on intersections of convex sets concerns families of 1pierceable sets. This note gives a complete solution to the following Hellytype problem: If d and n are positive integers, what is the least h = h(d, n) such that a family of boxes in dspace is npierceable whenever each of its kmembered subfamilies is npierceable. (Author)
Descriptors : (*SET THEORY, *GRAPHICS), COMBINATORIAL ANALYSIS, CONVEX SETS, THEOREMS
Subject Categories : Theoretical Mathematics
Distribution Statement : APPROVED FOR PUBLIC RELEASE