Intersection sets and blocking sets play an important role in contemporary finite geometry. There are cryptographic applications depending on their construction and combinatorial properties. This paper contributes to this topic by answering the question: how many circles of an inversive plane will b
An intersection property for starshaped sets in the plane
β Scribed by Marilyn Breen
- Publisher
- Springer
- Year
- 1991
- Tongue
- English
- Weight
- 451 KB
- Volume
- 37
- Category
- Article
- ISSN
- 0046-5755
No coin nor oath required. For personal study only.
β¦ Synopsis
Let ~-be a family of compact starshaped sets in the plane. If every three and every two members of ~ have a union which is connected and simply connected, then N {F: F in ~} is simply connected and nonempty. Of course, if every three and every two members of ~-have a starshaped union, the same result holds.
1. Introduction
We begin with some familiar definitions. Let S be a subset of R d. For points x and y in S, we say x sees y via S if and only if the associated segment [x, 3:] lies in S. Set S is called starshaped if and only if there is some point p in S such that p sees via S each point of S, and the collection of all such points p is the (convex) kernel of S.
Various types of combinatorial results have been established for starshaped sets. There is a well-known characterization theorem by
π SIMILAR VOLUMES
## Dedicated to E. Corominas Kleitman, Shearer et Sturtevant ont 6tudi6 le probl~me de trouver l'entier maximum m pour lequel il existe une famille de m ensembles A1,..., Am, tous ~ k 616ments, satisfaisant la propri6t6 d'intersection d'Erd6s: A v f3 Aq Β’ AT d~s que p, q, r sont distincts. Nous do