Skip Navigation

Bulletin of the London Mathematical Society 1994 26(2):132-136; doi:10.1112/blms/26.2.132
© 1994 by London Mathematical Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Larman, D.
Right arrow Articles by Törocsik, J.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© London Mathematical Society

A Ramsey-Type Result for Convex Sets

David Larman, Jirí Matousek, János Pach and Jeno Törocsik

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 n1/5 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.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.