Topological graphs with no self-intersecting cycle of length 4

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2003, Pages 98-103

  Pinchasi, Rom ^a   Radoičić, Radoš ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Extremal Graph Theory; Self Intersecting Cycle; Topological Graphs

Indexed keywords

GEOMETRY; ITERATIVE METHODS; PROBLEM SOLVING; TOPOLOGY;

TOPOLOGICAL GRAPHS;

GRAPH THEORY;

EID: 0037700520     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/777792.777807     Document Type: Conference Paper

References (14)

1. P. K. Agarwal, E. Nevo, J. Pach, R. Pinchasi, M. Sharir, and S. Smorodinsky. Lenses in arrangements of pseudo-circles and their applications. In Proceedings of the 18th Annual Symposium on Computational Geometry 2002, pages 123-132, 2002.
2. S. A vital and H. Hanani. Graphs. Gilyonot Lematematika, 3:2-8, 1966.
3. B. Bollobás. Extremal graph theory. 1978.
4. P. Braß, G. Károlyi, and P. Valtr. A turán-type extremal theory for convex geometric graphs. Discrete and Computational Geometry, to appear, 2003.
5. P. Erdos and M. Simonovits. Some extremal problems in graph theory. In Combinatorial theory and its applications, I, pages 377-390. Balatonfured, 1969.
6. P. Erdos and M. Simonovits. Cube-supersaturated graphs and related problems. In Progress in graph theory (Waterloo, Ontario, 1982), pages 203-218. Academic Press, Toronto, 1984.
7. A. Hanani. Uber wesentlich unplattbare kurven im drei-dimensionalen raume. Fund. Math., 23:135-142, 1934.
8. T. Kovári, V. Sós, and P. Turán. On a problem of k. zarankiewicz. Colloquium Mathematicum, 3:50-57, 1954.
9. Y. Kupitz. Extremal problems in combinatorial geometry. Aarhus University Lecture Notes Series, 53, 1979.
10. J. Pach, R. Radoičić, and G. Tóth. Relaxating planarity for topological graphs, page to appear.
11. J. Fach, R. Pinchasi, G. Tardos, and G. Tóth. Geometric graphs with no self-intersecting path of length three. In Graph Drawing 2002, Lecture Notes in Computer Science, page to appear.
12. H. Tamaki and T. Tokuyama. How to cut pseudo-parabolas into segments. Discrete and Computational Geometry, 19:265-290, 1998.
13. G. Tardos. On the number of edges in a geometric graph with no short self-intersecting paths, page in preperation.
14. W. T. Tutte. Toward a theory of crossing numbers. Journal of Combinatorial Theory, 8:45-53, 1970.