Unexpected behaviour of crossing sequences
Abstract
The n-th crossing number of a graph G, denoted crn(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 cr0(G) = a, cr1(G) = b, and cr2(G) = 0. This provides support for a conjecture of Archdeacon et al. and resolves a problem of Salazar.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.