A Ramsey-Type Theorem in the Plane

Combinatorics, Probability and Computing

Volumn 3, Issue 1, 1994, Pages 127-135

  Nešetřil, Jaroslav ^a   Valtr, Pavel ^b  

^a CHARLES UNIVERSITY   (Czech Republic)

^b FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84974054490     PISSN: 09635483     EISSN: 14692163     Source Type: Journal    
DOI: 10.1017/S0963548300001024     Document Type: Article

References (19)

1. Bárány I. and Füredi Z. (1987) Empty simplices in Euclidean space. Canadian Math. Bull. 30 436–445.
2. Erdős P. and Szekeres G. (1935) A combinatorial problem in geometry. Compositio Math. 2 463–470.
3. Goodman J.E. and Pollack R. (1991) The complexity of point configurations. Discrete Appl. Math. 31 167–180.
4. Goodman J.E. and Pollack R. (1993) Allowable sequences and order types in discrete and computational geometry, in: Pach J. (ed.), New trends in discrete and computational geometry, Springer-Verlag.
5. Graham R.L., Rothschild B., and Spencer J., (1980) Ramsey Theory, J. Wiley & Sons, New York.
6. Hales A.W., and Jewett R.I., (1963) Regularity of Positional Games, Trans. Am. Math. Soc. 106 222–229.
7. Harborth H., (1978) Konvexe Fünfecke in ebenen Punktmengen. Elem. Math. 33 116–118.
8. Horton J.D., (1983) Sets with no empty convex 7-gons. Canadian Math. Bull. 26 482–484.
9. Korte B., and Lovász L., (1985) Posets, matroids, and greedoids. in: Lovász L. and Recski A. (eds.), Matroid theory, North-Holland, 239–265.
10. Korte B. Lovász L. and Schrader R. (1991) Greedoids, Springer-Verlag, Berlin.
11. Lovász L. (1979) Topological and algebraic methods in graph theory. In: Bondy A. and Murty U.S.R. (eds.), Graph Theory and Related Topics, Academic Press 1–14.
12. Moser W. and Pach J. (1993) Recent developments in combinatorial geometry. In: Pach J. (ed.) New trends in discrete and computational geometry, Springer-Verlag.
13. Nešetřil J. Poljak S. and Turzík D. (1981) Amalgamation of matroids and its applications, J. Comb. Th. B 31 9–22.
14. Nešetřil J. and Rödl V. (eds.) (1990) Mathematics of Ramsey Theory, Springer-Verlag (1990).
15. Nešetřil J. and Valtr P. (preprint) Order types containing approximately an affine transformation of the grid k × k.
16. Pach J. (1991) Notes on Geometric Graph Theory. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 6 273–285.
17. Ramsey F.P. (1930) On a problem of formal logic. Proc. Lond. Math. Soc, II. Ser. 30 264–286.
18. Shelah S. (1988) Primitive recursive bounds for van der Waerden numbers. Journal AMS 1 683–697.
19. Valtr P. (1992) Convex independent sets and 7-holes in restricted planar point sets. Discrete Comput. Geom. 7 135–152.