Unavoidable Configurations in Complete Topological Graphs

  • János Pach
  • Géza Tóth
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1984)


A topological graph is a graph drawn in the plane so that its vertices are represented by points, and its edges are represented by Jordan curves connecting the corresponding points, with the property that any two curves have at most one point in common. We define two canonical classes of topological complete graphs, and prove that every topological complete graph with n vertices has a canonical subgraph of size at least c log log n, which belongs to one of these classes. We also show that every complete topological graph with n vertices has a non- crossing subgraph isomorphic to any fixed tree with at most c log1/6 n vertices.


  1. [AH66]
    S. Avital and H. Hanani: Graphs (Hebrew), Gilyonot Lematematika 3 (1966), 2–8.Google Scholar
  2. [AR88]
    D. Archdeacon and B. R. Richter: On the parity of crossing numbers, J. Graph Theory 12 (1988), 307–310.MATHCrossRefMathSciNetGoogle Scholar
  3. [C81]
    Ch. J. Colbourn: On drawings of complete graphs, J. Combin. Inform. System Sci. 6 (1981), 169–172.MATHMathSciNetGoogle Scholar
  4. [CN00]
    G. Cairns and Y. Nikolayevsky: Bounds for generalized thrackles, Discrete Comput. Geom. 23 (2000), 191–206.MATHCrossRefMathSciNetGoogle Scholar
  5. [EET76]
    G. Ehrlich, S. Even, and R. E. Tarjan: Intersection graphs of curves in the plane, J. Combinatorial Theory, Ser. B 21 (1976), 8–20.MATHCrossRefMathSciNetGoogle Scholar
  6. [EG73]
    P. Erdős and R. K. Guy: Crossing number problems, Amer. Math. Monthly 80 (1973), 52–58.CrossRefMathSciNetGoogle Scholar
  7. [EH89]
    P. Erdős and A. Hajnal: Ramsey-type theorems, Discrete Appl. Math. 25 (1989), 37–52.CrossRefMathSciNetGoogle Scholar
  8. [ES35]
    P. Erdős and G. Szekeres: A combinatorial problem in geometry, Compositio Mathematica 2 (1935), 463–470.MathSciNetGoogle Scholar
  9. [ES60]
    P. Erdős and G. Szekeres: On some extremum problems in elementary geometry, Ann. Universitatis Scientiarum Budapestinensis, Eötvös, Sectio Mathematica III–IV (1960–61), 53–62.Google Scholar
  10. [GJ85]
    M. R. Garey and D. S. Johnson: Crossing number is NP-complete, SIAM J. Algebraic Discrete Methods 4 (1983), 312–316.MATHCrossRefMathSciNetGoogle Scholar
  11. [GMPP91]
    P. Gritzmann, B. Mohar, J. Pach, and R. Pollack: Embedding a planar triangulation with vertices at specified points, Amer. Math. Monthly 98 (1991), 165–166.CrossRefMathSciNetGoogle Scholar
  12. [GH90]
    H.-D. Gronau and H. Harborth: Numbers of nonisomorphic drawings for small graphs, in: Proceedings of the Twentieth Southeastern Conference on Combinatorics, Graph Theory, and Computing (Boca Raton, FL, 1989), Congr. Numer. 71 (1990), 105–114.Google Scholar
  13. [G69]
    R. K. Guy: The decline and fall of Zarankiewicz’s theorem, in: Proof Techniques in Graph Theory, Academic Press, New York, 1969, 63–69.Google Scholar
  14. [HM74]
    H. Harborth and I. Mengersen: Edges without crossings in drawings of complete graphs, J. Combinatorial Theory, Ser. B 17 (1974), 299–311.MATHCrossRefMathSciNetGoogle Scholar
  15. [HM90]
    H. Harborth and I. Mengersen: Edges with at most one crossing in drawings of the complete graph, in: Topics in Combinatorics and Graph Theory (Oberwolfach, 1990), Physica, Heidelberg, 1990, 757–763.Google Scholar
  16. [HM92]
    H. Harborth and I. Mengersen: Drawings of the complete graph with maximum number of crossings, in: Proceedings of the Twenty-third Southeastern International Conference on Combinatorics, Graph Theory, and Computing (Boca Raton, FL, 1992), Congr. Numer. 88 (1992), 225–228.Google Scholar
  17. [HMS95]
    H. Harborth, I. Mengersen, and R. H. Schelp: The drawing Ramsey number Dr(Kn), Australasian J. Combinatorics 11 (1995), 151–156.MATHMathSciNetGoogle Scholar
  18. [HT94]
    H. Harborth and Ch. Thürmann: Minimum number of edges with at most s crossings in drawings of the complete graph, in: Proceedings of the Twenty-fifth Southeastern International Conference on Combinatorics, Graph Theory and Computing (Boca Raton, FL, 1994), Congr. Numer. 102 (1994), 83–90.Google Scholar
  19. [K79]
    Y. S. Kupitz: Extremal Problems in Combinatorial Geometry, Lecture Notes Series 53, Aarhus Universitet, Matematisk Institut, Aarhus, 1979.Google Scholar
  20. [LPS97]
    L. Lovász, J. Pach, and M. Szegedy: On Conway’s thrackle conjecture, Discrete and Computational Geometry 18 (1997), 369–376.MATHCrossRefMathSciNetGoogle Scholar
  21. [M78]
    I. Mengersen: Die Maximalzahl von kreuzungsfreien Kanten in Darstellungen von vollständigen n-geteilten Graphen (German), Math. Nachr. 85 (1978), 131–139.MATHCrossRefMathSciNetGoogle Scholar
  22. [P99]
    J. Pach: Geometric graph theory, in: Surveys in Combinatorics, 1999 (Canterbury), London Math. Soc. Lecture Note Ser. 267, Cambridge Univ. Press, Cambridge, 1999, 167–200.Google Scholar
  23. [PA95]
    J. Pach and P. K. Agarwal: Combinatorial Geometry, Wiley-Interscience, New York, 1995.Google Scholar
  24. [PSS96]
    J. Pach, F. Shahrokhi, and M. Szegedy: Applications of crossing numbers, Algorithmica 16 (1996), 111–117.MATHMathSciNetCrossRefGoogle Scholar
  25. [PT94]
    J. Pach and J. Törőcsik: Some geometric applications of Dilworth’s theorem, Discrete and Computational Geometry 12 (1994), 1–7.MATHCrossRefMathSciNetGoogle Scholar
  26. [PT98]
    J. Pach and G. Töth: Which crossing number is it, anyway? Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998, 617–626.Google Scholar
  27. [R64]
    G. Ringel: Extremal problems in the theory of graphs, in: Theory of Graphs and its Applications (Proc. Sympos. Smolenice, 1963), Publ. House Czechoslovak Acad. Sci., Prague, 1964, 85–90.Google Scholar
  28. [TV98]
    G. Tóth and P. Valtr: Note on the Erdös-Szekeres theorem, Discrete Comput. Geom. 19 (1998), 457–459.MATHCrossRefMathSciNetGoogle Scholar
  29. [T77]
    P. Turán: A note of welcome, J. Graph Theory 1 (1977), 7–9.CrossRefGoogle Scholar
  30. [W71]
    D. R. Woodall: Thrackles and deadlock, in: Combinatorial Mathematics and its Applications (Proc. Conf., Oxford, 1969), Academic Press, London, 1971, 335–347.Google Scholar
  31. [WB78]
    A. T. White and L. W. Beineke: Topological graph theory, in: Selected Topics in Graph Theory (L. W. Beineke and R. J. Wilson., eds.), Academic Press, Inc. [Harcourt Brace Jovanovich, Publishers], London-New York, 1983, 15–49.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • János Pach
    • 1
  • Géza Tóth
    • 2
  1. 1.NYU and Hungarian Academy of SciencesCourant InstituteHungary
  2. 2.Massachusetts Institute of Technology and Hungarian Academy of SciencesHungary

Personalised recommendations