© 1994 by London Mathematical Society
A Ramsey-Type Result for Convex Sets
í Matou
ek
Tör
csik
Department of Mathematics, University College London
Charles University Prague, Czechoslovakia and Free University Berlin, Germany
Hungarian Academy of Sciences City College New York, USA
Eötvös University, Budapest, Hungary and Department of Computer Science, Princeton University Princeton, USA
Received 29 October 1992.
Given a family of n convex compact sets in the plane, one can always choose n
of them which are either pairwise disjoint or pairwise intersecting. On the other hand, there exists a family of n segments in the plane such that the maximum size of a subfamily with pairwise disjoint or pairwise intersecting elements in nlog2/log5
n0·431.