The 2-Page Crossing Number of Kn

Bernardo M. Ábrego, Oswin Aichholzer, Silvia Fernández-Merchant*, Pedro Ramos, Gelasio Salazar

*Korrespondierende/r Autor/-in für diese Arbeit

Publikation: Beitrag in einer FachzeitschriftArtikelBegutachtung


Around 1958, Hill described how to draw the complete graph Kn with, crossings, and conjectured that the crossing number cr(Kn) is exactly Z(n). This is also known as Guy's conjecture as he later popularized it. Towards the end of the century, substantially different drawings of Kn with Z(n) crossings were found. These drawings are 2-page book drawings, that is, drawings where all the vertices are on a line ℓ (the spine) and each edge is fully contained in one of the two half-planes (pages) defined by ℓ. The 2-page crossing number of Kn, denoted by ν2(Kn), is the minimum number of crossings determined by a 2-page book drawing of Kn. Since cr(Kn) ≤ ν2(Kn) and ν2(Kn) ≤ Z(n), a natural step towards Hill's Conjecture is the weaker conjecture ν2(Kn) = Z(n), popularized by Vrt'o. In this paper we develop a new technique to investigate crossings in drawings of Kn, and use it to prove that ν2(Kn) = Z(n). To this end, we extend the inherent geometric definition of k-edges for finite sets of points in the plane to topological drawings of Kn. We also introduce the concept of ≤≤ k-edges as a useful generalization of ≤k-edges and extend a powerful theorem that expresses the number of crossings in a rectilinear drawing of Kn in terms of its number of ≤k-edges to the topological setting. Finally, we give a complete characterization of crossing minimal 2-page book drawings of Kn and show that, up to equivalence, they are unique for n even, but that there exist an exponential number of non homeomorphic such drawings for n odd.

Seiten (von - bis)747-777
FachzeitschriftDiscrete and Computational Geometry
PublikationsstatusVeröffentlicht - Juni 2013


  • Discrete and Computational Geometry

ASJC Scopus subject areas

  • Theoretische Informatik
  • Geometrie und Topologie
  • Diskrete Mathematik und Kombinatorik
  • Theoretische Informatik und Mathematik


Untersuchen Sie die Forschungsthemen von „The 2-Page Crossing Number of Kn“. Zusammen bilden sie einen einzigartigen Fingerprint.

Dieses zitieren