Note on Geometric Graphs

Journal of Combinatorial Theory. Series A

Volumn 89, Issue 1, 2000, Pages 126-132

  Tóth, Géza ^a,b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0012134455     PISSN: 00973165     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcta.1999.3001     Document Type: Article

References (9)

1. Alon N., Erdos P. Disjoint edges in geometric graphs. Discrete Comput. Geom. 4:1989;287-290.
2. Avital S., Hanani H. Graphs. Gilyonot Lematematika. 3:1966;2-8.
3. Dilworth R. P. A decomposition theorem for partially ordered sets. Ann. of Math. 51:1950;161-166.
4. Hopf H., Pannwitz E. Aufgabe No. 167. Jahresber. Deutsch. Math.-Verein. 43:1934;114.
5. Kupitz Y. Extremal problems in combinatorial geometry. Aarhus University Lecture Notes Series. 1979;Aarhus University.
6. Larman D., Matoušek J., Pach J., Törocsik J. A Ramsey-type result for planar convex sets. Bull. London Math. Soc. 26:1994;132-136.
7. Pach J., Agarwal P. K. Combinatorial Geometry. 1995;Wiley, New York.
8. Pach J., Törocsik J. Some geometric applications of Dilworth's theorem. Discrete Comput. Geom. 12:1994;1-7.
9. Tóth G., Valtr P. Geometric graphs with few disjoint edges. Discrete Comput. Geom. 22:1999;633-642.