Intersection Reverse Sequences and Geometric Applications

  • Adam Marcus
  • Gábor Tardos
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3383)


Pinchasi and Radoičić [1] used the following observation to bound the number of edges in a topological graph with no self-intersecting cycles of length 4: if we make a list of the neighbors for every vertex in such a graph and order these lists cyclicly according to the connecting edge, then the common elements in any two lists have reversed cyclic order. Building on their work we give an estimate on the size of the lists having this property. As a consequence we get that a topological graph on n vertices not containing a self-intersecting C 4 has O(n 3/2log n) edges. Our result also implies that n pseudo-circles in the plane can be cut into O(n 3/2log n) pseudo-segments, which in turn implies bounds on point-curve incidences and on the complexity of a level of an arrangement of curves.


  1. 1.
    Pinchasi, R., Radoičič, R.: On the number of edges in geometric graphs with no self-intersecting cycle of length 4. In: Pach, J. (ed.) Towards a Theory of Geometric Graphs. Contemp. Math., vol. 342. Amer. Math. Soc., Providence (2004)Google Scholar
  2. 2.
    Tamaki, H., Tokuyama, T.: How to cut pseudo-parabolas into pseudosegments. Discrete Comput. Geom. 19, 265–290 (1998)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Aronov, B., Sharir, M.: Cutting circles into pseudo-segments and improved bounds for incidences. Discrete Comput. Geom. 28, 475–490 (2002)MATHMathSciNetGoogle Scholar
  4. 4.
    Agarwal, P., Nevo, E., Pach, J., Pinchasi, R., Sharir, M., Smorodinsky, S.: Lenses in arrangements of pseudo-circles and their applications. J. ACM 51, 139–186 (2004)CrossRefMathSciNetGoogle Scholar
  5. 5.
    Chan, T.M.: On levels in arrangements of curves. Discrete and Comput. Geom. 29, 375–393 (2000)Google Scholar
  6. 6.
    Chan, T.M.: On levels in arrangements of curves, II: a simple inequality and its consequence. In: Proc. 44th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 544–550 (2003)Google Scholar
  7. 7.
    Kővári, T., Sós, V.T., Turán, P.: On a problem of K. Zarankiewicz. Colloq. Math. 3, 50–57 (1954)MATHGoogle Scholar
  8. 8.
    Elekes, G.: Sums versus products in number theory, algebra and Erdös geometry. In: Hálász, G., et al. (eds.) Paul Erdős and his mathematics II. Based on the conference, Budapest, Hungary, July 4–11, 1999. Bolyai Soc. Math. Stud, vol. 11, pp. 241–290. Springer, Heidelberg (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Adam Marcus
    • 1
  • Gábor Tardos
    • 2
  1. 1.Department of MathematicsGeorgia Institute of TechnologyAtlantaUSA
  2. 2.Alfréd Rényi Institute of Mathematics, Pf.127BudapestHungary

Personalised recommendations