The conjecture cr(C_m\times C_n)=(m-2)n is true for all but finitely many n, for each m
| dc.creator | Glebsky, Lev | |
| dc.creator | Salazar, Gelasio | |
| dc.date | 2000-09-26 | |
| dc.date.accessioned | 2026-07-07T04:37:42Z | |
| dc.date.available | 2026-07-07T04:37:42Z | |
| dc.description | It has been long congectured that the crossing number of $C_m\times C_n$ is $(m-2)n$ for $2<m<=n$. In this paper we proved that conjecture is true for all but finitely many $n$ for each $m$. More specifically we proved conjecture for $n>=(m/2)((m+3)^2/2+1)$.The proof is largely based on the theory of arrangements introduced by Adamsson and further developed by Adamsson and Richter. | |
| dc.description | 16 pages, plainTeX, to be subnitted to "J. of Graph Theory" | |
| dc.identifier | https://arxiv.org/abs/math/0009230 | |
| dc.identifier | http://arxiv.org/abs/math/0009230 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/60000 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C10, 05C62, 57M15 | |
| dc.title | The conjecture cr(C_m\times C_n)=(m-2)n is true for all but finitely many n, for each m | |
| dc.type | text |