Mathematics – Combinatorics
Scientific paper
2009-11-02
Mathematics
Combinatorics
21 pages
Scientific paper
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.
DeVos Matt
Mohar Bojan
Samal Robert
No associations
LandOfFree
Unexpected behaviour of crossing sequences does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Unexpected behaviour of crossing sequences, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Unexpected behaviour of crossing sequences will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-255808