Unexpected behaviour of crossing sequences
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F11%3A10100999" target="_blank" >RIV/00216208:11320/11:10100999 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.jctb.2010.12.002" target="_blank" >http://dx.doi.org/10.1016/j.jctb.2010.12.002</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.jctb.2010.12.002" target="_blank" >10.1016/j.jctb.2010.12.002</a>
Alternative languages
Result language
angličtina
Original language name
Unexpected behaviour of crossing sequences
Original language description
The nth 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.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Journal of Combinatorial Theory. Series B
ISSN
0095-8956
e-ISSN
—
Volume of the periodical
101
Issue of the periodical within the volume
6
Country of publishing house
US - UNITED STATES
Number of pages
16
Pages from-to
448-463
UT code for WoS article
000294972800004
EID of the result in the Scopus database
—