The crossing number of Cm × Cn is as conjectured for n ≥ m(m%2b1)
Article
-
- Overview
-
- Research
-
- Identity
-
- Additional Document Info
-
- View All
-
Overview
abstract
-
It has been long conjectured that the crossing number of Cm × Cn is (m - 2)n, for all m, n such that n ≥ m ≥ 3. In this paper, it is shown that if n ≥ m(m %2b 1 ) and m ≥ 3, then this conjecture holds. That is, the crossing number of Cm × C n is as conjectured for all but finitely many n, for each m. The proof is largely based on techniques from the theory of arrangements, introduced by Adamsson and further developed by Adamsson and Richter. © 2004 Wiley Periodicals, Inc.
publication date
published in
Research
keywords
-
Cartesian product of cycles; Crossing number; Graph drawing Combinatorial mathematics; Graph theory; Mathematical models; Mathematical operators; Optimization; Theorem proving; Cross-critical graphs; Crossing number; Number theory
Identity
Digital Object Identifier (DOI)
Additional Document Info
start page
end page
volume
issue