Geometric graphs with no self-intersecting path of length three

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2528 LNCS, Issue , 2002, Pages 295-311

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

^a NEW YORK UNIVERSITY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS);

GEOMETRIC GRAPHS;

GRAPH THEORY;

EID: 84867469663     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36151-0_28     Document Type: Conference Paper

References (14)

1. P. K. Agarwal, B. Aronov, J. Pach, R. Pollack, and M. Sharir, Quasi-planar graphs have a linear number of edges, Combinatorica 17 (1997), 1-9.
2. S. Avital and H. Hanani, Graphs (in Hebrew), Gilyonot Lematematika 3 (1966), 2-8.
3. B. Bollobás, Extremal Graph Theory, Academic Press, New York, 1978.
4. A. Bondy and M. Simonovits, Cycles of even length in graphs, J. Combinatorial Theory, Ser. B 16 (1974), 97-105.
5. Z. Füredi, On a Turán type problem of Erdos, Combinatorica 11 1 (1991), 75-79.
6. Z. Füredi and P. Hajnal, Davenport-Schinzel theory of matrices, Discrete Mathematics 103 (1992), 233-251.
7. H. Hanani (C. Chojnacki), Über wesentlich unplättbare Kurven in dreidimensionalen Raume, Fundamenta Mathematicae 23 (1934), 135-142.
8. Y. Kupitz, Extremal Problems in Combinatorial Geometry, Aarhus University Lecture Notes Series 53, Aarhus University, Denmark, 1979.
9. J. Pach, Geometric graph theory, in: Surveys in Combinatorics, 1999 (J. D. Lamb and D. A. Preece, eds.), London Mathematical Society Lecture Notes 267, Cambridge University Press, Cambridge, 1999, 167-200.
10. J. Pach and G. Tóth, Graphs drawn with few crossings per edge, Combinatorica 17 (1997), 427-439.
11. R. Pinchasi and R. Radoičić, On the number of edges in geometric graphs with no self-intersecting cycle of length 4, to appear.
12. G. Tardos, On the number of edges in a geometric graph with no short self-intersecting paths, to appear.
13. W. T. Tutte, Toward a theory of crossing numbers, J. Combinatorial Theory 8 (1970), 45-53.
14. P. Valtr, On geometric graphs with no k pairwise parallel edges, Discrete and Computational Geometry 19 (1998), 461-469.