David Larman, Jirí Matousek, János Pach, et al.  Home/Search
Context Related
| nyu.edu/~pach/publica...larmanramsey.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: nyu.edu/~pach/publications/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: 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 is n . (Update)
Similar documents based on text: More All
0.4: Covering Lattice Points by Subspaces - Bárány, Harcos, Pach, Tardos (Correct)
0.4: Erdös-Szekeres-type theorems for segments and non-crossing.. - Pach, Toth (1998) (Correct)
0.4: A Ramsey-Type Theorem for Bipartite Graphs - Erdös, Hajnal, Pach (Correct)
BibTeX entry: (Update)
D.G. Larman, J. Matousek, J. Pach and J. Torocsik, A Ramsey-type result for convex sets, Bulletin of the London Mathematical Society 26 (1994), 132-136. http://citeseer.ist.psu.edu/larman94ramseytype.html More
@misc{ larman94ramseytype,
author = "D. Larman and J. Matousek and J. Pach and J. Torocsik",
title = "A Ramsey-type result for convex sets",
text = "D.G. Larman, J. Matousek, J. Pach and J. Torocsik, A Ramsey-type result
for convex sets, Bulletin of the London Mathematical Society 26 (1994),
132-136.",
year = "1994",
url = "citeseer.ist.psu.edu/larman94ramseytype.html" }
Citations (may not include all citations):51 London Math (context) - Besicovitch, problem - 1947
18 SpencerRamsey theory (context) - Spencer, nd et al. - 1990
6 London Math (context) - Rado, for et al. - 1948
3 os: Some Remarks on the Theory of Graphs (context) - Erd - 1947
2 Lehel: Covering and Coloring Problems for Relatives of Inter.. (context) - Gy, as - 1985
1 Discrete Geometrie (context) - Pach, multiple et al. - 1980
1 Uber das Problem der Nachbargeibiete im Raum (context) - Tietze - 1905
1 Dagstuhl Seminar Report (context) - Alt, Chazelle et al.
Documents on the same site (http://www.math.nyu.edu/~pach/publications/): More
An Algorithm for Finding Many Disjoint Monochromatic Edges in.. - Károlyi, al. (Correct)
Cellular Telephone Networks and Random Maps in Hypergraphs - Halpert, Lengyel, Pach (1999) (Correct)
A generalization of the Erdös-Szekeres theorem to disjoint.. - Pach, Tóth (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC