Geometric graphs with few disjoint edges

Discrete and Computational Geometry

Volumn 22, Issue 4, 1999, Pages 633-642

  Toth G ^a,b   Valtr, P ^b,c  

^a NEW YORK UNIVERSITY   (United States)

^b RUTGERS UNIVERSITY   (United States)

^c CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033458175     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009482     Document Type: Article

References (13)

1. N. Alon and P. Erdo″s, Disjoint edges in geometric graphs, Discrete and Computational Geometry 4 (1989), 287-290.
2. S. Avital and H. Hanani, Graphs, Gilyonot Lematematika 3 (1966), 2-8 (in Hebrew).
3. R. P. Dilworth, A decomposition theorem for partially ordered sets, Annals of Mathematics 51(1950), 161-166.
4. W. Goddard, M. Katchalski, and D. J. Kleitman, Forcing disjoint segments in the plane, European Journal of Combinatorics 17 (1996), 391-395.
5. H. Hopf and E. Pannwitz, Aufgabe No. 167, Jahresbericht der Deutschen Mathematiker-Vereinigung 43 (1934), 114.
6. Y. Kupitz, Extremal Problems in Combinatorial Geometry, Aarhus University Lecture Notes Series, 53, Aarhus University, Denmark (1979).
7. D. Larman, J. Matoǔek, J. Pach, and J. Töro″csik, A Ramsey-type result for planar convex sets, The Bulletin of the London Mathematical Society 26 (1994), 132-136.
8. W. Moser and J. Pach, Recent developments in combinatorial geometry, in: New Trends in Discrete and Computational Geometry (J. Pach, ed.), Algorithms and Combinatorics, Vol. 10, Springer-Verlag, Berlin, 1993, pp. 281-302.
9. J. Pach, Personal Communication.
10. J. Pach and P. K. Agarwal, Combinatorial Geometry, Wiley, New York, 1995.
11. J. Pach and J. Töro″csik, Some geometric applications of Dilworth's theorem, Discrete and Computational Geometry 12 (1994), 1-7.
12. G. Tóth, Note on geometric graphs (manuscript).
13. P. Valtr, On geometric graphs with no k pairwise parallel edges, Discrete and Computational Geometry 19 (1998), 461-469.