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

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

2000-09-26

arxiv.org/abs/math/0009230v1

Mathematics

Combinatorics

16 pages, plainTeX, to be subnitted to "J. of Graph Theory"

Scientific paper

It has been long congectured that the crossing number of $C_m\times C_n$ is $(m-2)n$ for $2=(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.

Affiliated with

Also associated with

No associations

Rating

The conjecture cr(C_m\times C_n)=(m-2)n is true for all but finitely many n, for each m 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 The conjecture cr(C_m\times C_n)=(m-2)n is true for all but finitely many n, for each m, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The conjecture cr(C_m\times C_n)=(m-2)n is true for all but finitely many n, for each m will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-631690