The conjecture cr(C_m\times C_n)=(m-2)n is true for all but finitely many n, for each m

MaRDI QIDQ6470641zbMATH OpenFDO

Authors Lev Glebsky, Gelasio Salazar

Publication date 26 September 2000

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62) Relations of low-dimensional topology with graph theory (57M15)

Abstract: It has been long congectured that the crossing number of $C_{m}imes{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.

This page was built for publication: The conjecture cr(C_m\times C_n)=(m-2)n is true for all but finitely many n, for each m

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6470641)