Abstract: The n-th crossing number of a graph G, denoted cr_n(G), is the minimum number of crossings in a drawing of G on an orientable surface of genus n. We prove that for every a>b>0, there exists a graph G for which cr_0(G) = a, cr_1(G) = b, and cr_2(G) = 0. This provides support for a conjecture of Archdeacon et al. and resolves a problem of Salazar.
Recommendations
Cites work
- A minimax theorem on circuits in projective graphs
- Crossing Number of Graphs with Rotation Systems
- Graphs on surfaces
- On the crossing numbers of loop networks and generalized Petersen graphs
- Surfaces and planar discontinuous groups. Revised and expanded transl. from the German by J. Stillwell
- The crossing function of a graph
- Trading crossings for handles and crosscaps
Cited in
(6)- On the Pseudolinear Crossing Number
- Characterizing homotopy of systems of curves on a compact surface by crossing numbers
- A nonconvex nonorientable crossing number sequence
- Trading crossings for handles and crosscaps
- Unexpected behaviour of crossing sequences
- Drawing a disconnected graph on the torus (extended abstract)
This page was built for publication: Unexpected behaviour of crossing sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q651034)
