Discrete & Computational Geometry

, Volume 39, Issue 1, pp 442–454

Odd Crossing Number and Crossing Number Are Not the Same

Authors

    • Department of Applied MathematicsIllinois Institute of Technology
  • Marcus Schaefer
    • Department of Computer ScienceDePaul University
  • Daniel Štefankovič
    • Computer Science DepartmentUniversity of Rochester
Article

DOI: 10.1007/s00454-008-9058-x

Cite this article as:
Pelsmajer, M.J., Schaefer, M. & Štefankovič, D. Discrete Comput Geom (2008) 39: 442. doi:10.1007/s00454-008-9058-x

Abstract

The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the number of pairs of edges that intersect an odd number of times, we obtain the odd crossing number. We show that there is a graph for which these two concepts differ, answering a well-known open question on crossing numbers. To derive the result we study drawings of maps (graphs with rotation systems).

Download to read the full article text

Copyright information

© Springer Science+Business Media, LLC 2008