On geometric graphs with no k pairwise parallel edges

Discrete and Computational Geometry

Volumn 19, Issue 3, 1998, Pages 461-469

  Valtr, P ^a,b  

^a CHARLES UNIVERSITY   (Czech Republic)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032391089     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009364     Document Type: Article

References (12)

1. R. Adamec, M. Klazar, and P. Valtr, Generalized Davenport-Schinzel sequences with linear upper hound, Discrete Math., 108 (1992), 219-229.
2. P. K. Agarwal, B. Aronov, J. Fach, R. Pollack, and M. Sharir, Quasi-planar graphs have a linear number of edges, In: Graph Drawing (Passau), Lecture Notes in Computer Science, vol. 1027, 1995, pp. 1-7.
3. H. Davenport and A. Schinzel, A combinatorial problem connected with differential equations, Amer. J. Math., 87 (1965), 684-694.
4. R. Dilworth, A decomposition theorem for partially ordered sets, Ann. of Math., 51 (1950), 161-166.
5. M. Katchalski and H. Last, On geometric graphs with no two edges in convex position, Discrete Comput. Geom., this issue, pp. 399-404.
6. M. Klazar and P. Valtr, Generalized Davenport-Schinzel sequences, Combinatorica. 14 (1994), 463-476.
7. Y. Kupitz, Extremal Problems in Combinatorial Geometry, Aarhus University Lecture Notes Series, vol. 53, 1979.
8. H. Last, Turán type problems for geometric graphs, Ms. C. Thesis, Technion-I.I.T., Haifa, 1994. In Hebrew.
9. J. Pach and P. K. Agarwal, Combinatorial Geometry, Wiley Interscience, New York, 1995.
10. J. Pach, F. Shahrokhi, and M. Szegedy, Applications of the crossing number, Algorithmica, 16 (1996), 111-117.
11. J. Pach and J. Törocsik, Some geometric applications of Dilworth's theorem, Discrete Comput. Geom., 12(1994), 1-7.
12. P. Valtr, Graph drawings with no k pairwise crossing edges, In: Graph Drawing (Rome), Lecture Notes in Computer Science, vol. 1353, 1997, pp. 205-218.