New Bounds on the Maximum Number of Edges in k-Quasi-Planar Graphs

  • Andrew Suk
  • Bartosz Walczak
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8242)


A topological graph is k-quasi-planar if it does not contain k pairwise crossing edges. An old conjecture states that for every fixed k, the maximum number of edges in a k-quasi-planar graph on n vertices is O(n). Fox and Pach showed that every k-quasi-planar graph with n vertices and no pair of edges intersecting in more than O(1) points has at most n(logn) O(logk) edges. We improve this upper bound to \(2^{\alpha(n)^c}n\log n\), where α(n) denotes the inverse Ackermann function, and c depends only on k. We also show that every k-quasi-planar graph with n vertices and every two edges have at most one point in common has at most O(nlogn) edges. This improves the previously known upper bound of \(2^{\alpha(n)^c}n\log n\) obtained by Fox, Pach, and Suk.


  1. 1.
    Ackerman, E.: On the maximum number of edges in topological graphs with no four pairwise crossing edges. Discrete Comput. Geom. 41, 365–375 (2009)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Agarwal, P.K., Aronov, B., Pach, J., Pollack, R., Sharir, M.: Quasi-planar graphs have a linear number of edges. Combinatorica 17, 1–9 (1997)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Alon, N., Spencer, J.: The Probabilistic Method, 3rd edn. Wiley Interscience (2008)Google Scholar
  4. 4.
    Brass, P., Moser, W., Pach, J.: Research Problems in Discrete Geometry. Springer (2005)Google Scholar
  5. 5.
    Capoyleas, V., Pach, J.: A Turán-type theorem on chords of a convex polygon. J. Combin. Theory Ser. B 56, 9–15 (1992)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Dilworth, R.P.: A decomposition theorem for partially ordered sets. Ann. Math. 51, 161–166 (1950)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Fox, J., Pach, J.: Coloring K k-free intersection graphs of geometric objects in the plane. European J. Combin. 33, 853–866 (2012)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Fox, J., Pach, J., Suk, A.: The number of edges in k-quasi-planar graphs. SIAM J. Discrete Math. 27, 550–561 (2013)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Klazar, M.: A general upper bound in extremal theory of sequences, Comment. Math. Univ. Carolin. 33, 737–746 (1992)MathSciNetMATHGoogle Scholar
  10. 10.
    Lasoń, M., Micek, P., Pawlik, A., Walczak, B.: Coloring intersection graphs of arc-connected sets in the plane (manuscript)Google Scholar
  11. 11.
    McGuinness, S.: Colouring arcwise connected sets in the plane I. Graphs Combin. 16, 429–439 (2000)MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
    McGuinness, S.: On bounding the chromatic number of L-graphs. Discrete Math. 154, 179–187 (1996)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Nivasch, G.: Improved bounds and new techniques for Davenport-Schinzel sequences and their generalizations. J. Assoc. Comput. Machin. 57, 1–44 (2010)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Pach, J., Radoičić, R., Tóth, G.: Relaxing planarity for topological graphs. In: Győri, E., Katona, G.O.H., Lovász, L., Fleiner, T. (eds.) More Sets, Graphs and Numbers, Bolyai Soc. Math. Stud., vol. 15, pp. 285–300. Springer (2006)Google Scholar
  15. 15.
    Pach, J., Shahrokhi, F., Szegedy, M.: Applications of the crossing number. J. Graph Theory 22, 239–243 (1996)MathSciNetCrossRefGoogle Scholar
  16. 16.
    Pettie, S.: Generalized Davenport-Schinzel sequences and their 0-1 matrix counterparts. J. Combin. Theory Ser. A 118, 1863–1895 (2011)MathSciNetCrossRefMATHGoogle Scholar
  17. 17.
    Pettie, S.: On the structure and composition of forbidden sequences, with geometric applications. In: 27th ACM Symposium on Computational Geometry, pp. 370–379. ACM (2011)Google Scholar
  18. 18.
    Suk, A.: Coloring intersection graphs of x-monotone curves in the plane. Combinatorica (to appear)Google Scholar
  19. 19.
    Valtr, P.: On geometric graphs with no k pairwise parallel edges. Discrete Comput. Geom. 19, 461–469 (1998)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2013

Authors and Affiliations

  • Andrew Suk
    • 1
  • Bartosz Walczak
    • 2
    • 3
  1. 1.Massachusetts Institute of TechnologyCambridgeUSA
  2. 2.École Polytechnique Fédérale de LausanneSwitzerland
  3. 3.Theoretical Computer Science Department, Faculty of Mathematics and Computer ScienceJagiellonian UniversityKrakówPoland

Personalised recommendations