Geometric graphs with no self-intersecting path of length three

European Journal of Combinatorics

Volumn 25, Issue 6, 2004, Pages 793-811

  Pach, János ^a   Pinchasi, Rom ^b   Tardos, Gábor ^c   Tóth, Géza ^c  

^a CITY COLLEGE OF NEW YORK   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 4043104210     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejc.2003.09.019     Document Type: Article

References (18)

1. Agarwal P.K. Aronov B. Pach J. Pollack R. Sharir M. Quasi-planar graphs have a linear number of edges Combinatorica 17 1997 1-9
2. Anstee R.P. Ferguson R. Sali A. Small forbidden configurations II Electronic Journal of Combinatorics 8 2001 R4 25
3. Anstee R.P. Griggs J.R. Sali A. Small forbidden configurations Graphs and Combinatorics 13 1997 97-118
4. Avital S. Hanani H. Graphs Gilyonot Lematematika 3 1966 2-8 (in Hebrew)
5. Bollobás B. Extremal Graph Theory 1978 Academic Press New York
6. Bondy A. Simonovits M. Cycles of even length in graphs Journal of Combinatorial Theory, Series B 16 1974 97-105
7. Füredi Z. On a Turán type problem of Erdo Combinatorica 11 1991 75-79
8. Füredi Z. Hajnal P. Davenport-Schinzel theory of matrices Discrete Mathematics 103 1992 233-251
9. Hanani (C. Chojnacki) H. Über wesentlich unplättbare Kurven in dreidimensionalen Raume Fundamenta Mathematicae 23 1934 135-142
10. Kupitz Y. Extremal Problems in Combinatorial Geometry Aarhus University Lecture Notes Series vol. 53 1979 Aarhus University Denmark
11. Pach J. Geometric graph theory in: Lamb J.D. Preece D.A. (Eds.), Surveys in Combinatorics, 1999 London Mathematical Society Lecture Notes vol. 267 1999 167-200 Cambridge University Press Cambridge
12. J. Pach, Geometric graph theory, in: J.E. Goodman, J. O'Rourke (Eds.), Handbook of Discrete and Computational Geometry, CRC Press, Boca Raton, FL (Chapter 10) (in press)
13. Pach J. Tóth G. Graphs drawn with few crossings per edge Combinatorica 17 1997 427-439
14. J. Pach, R. Radoičić, G. Tóth, Relaxing planarity for topological graphs, in: E. Györi et al. (Eds.), Finite and Infinite Combinatorics, Bolyai Society Mathematical Studies, Budapest (in press)
15. Pinchasi R. Radoičić R. On the number of edges in geometric graphs with no self-intersecting cycle of length 4 19th ACM Symposium on Computational Geometry 2003 98-103 ACM New York Also in: Towards a Theory of Geometric Graphs, Contemporary Mathematics, J. Pach, (Ed.), American Mathematical Society, Providence, RI (in press)
16. G. Tardos, On the number of edges in a geometric graph with no short self-intersecting paths (manuscript)
17. Tutte W.T. Toward a theory of crossing numbers Journal of Combinatorial Theory 8 1970 45-53
18. P. Valtr, On geometric graphs with no k pairwise parallel edges, Discrete and Computational Geometry 19 (1998) 461-469.