Convex sets in the plane with three of every four meeting (Q5955197)
From MaRDI portal
scientific article; zbMATH DE number 1703946
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Convex sets in the plane with three of every four meeting |
scientific article; zbMATH DE number 1703946 |
Statements
Convex sets in the plane with three of every four meeting (English)
0 references
13 February 2002
0 references
The authors consider the following problem. Suppose we have a finite collection of closed convex sets (polygons) and suppose further that among any four of them, some three have non-empty intersection. The conclusion is that 13 points are sufficient to meet every one of the convex sets.
0 references
convex sets
0 references
