Convex Sets in the Plane with Three of Every Four Meeting |
| |
| Authors: | Daniel J. Kleitman András Gyárfás Géza Tóth |
| |
| Affiliation: | (1) Massachusetts Institute of Technology; 77 Massachusetts Avenue, Cambridge MA 02139, USA; E-mail: djk@math.mit.edu, US;(2) Computer and Automation Research Institute, Hungarian Academy of Sciences; 1111 Budapest, Kende u. 13–17, Hungary; E-mail: gyarfas@luna.aszi.sztaki.hu, HU;(3) Massachusetts Institute of Technology; 77 Massachusetts Avenue, Cambridge MA 02139, USA; and Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences; 1053 Budapest, Reáltanoda u. 13-15., Hungary; E-mail: toth@math.mit.edu, HU |
| |
| Abstract: | Dedicated to the memory of Paul Erdős Suppose we have a finite collection of closed convex sets in the plane, (which without loss of generality we can take to be polygons). Suppose further that among any four of them, some three have non-empty intersection. We show that 13 points are sufficient to meet every one of the convex sets. Received October 27, 1999/Revised April 11, 2000 RID="*" ID="*" Supported by grant OTKA-T-029074. RID="†" ID="†" Supported by NSF grant DMS-99-70071, OTKA-T-020914 and OTKA-F-22234. |
| |
| Keywords: | AMS Subject Classification (2000) Classes: 52A35 |
| 本文献已被 SpringerLink 等数据库收录！ |
|
