We prove that the crossing number of C5 x C, is 372, which is consistent with the general conjecture that the crossing number of C,, x C, is ( m -2)n, for 3 5 m 5 n.
The Crossing Number ofC(mk;{1,k})
✍ Scribed by Xiaohui Lin; Yuansheng Yang; Jianguo Lü; Xin Hao
- Publisher
- Springer Japan
- Year
- 2005
- Tongue
- English
- Weight
- 328 KB
- Volume
- 21
- Category
- Article
- ISSN
- 0911-0119
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
In this article, we will determine the crossing number of the complete tripartite graphs K,.3.n and K2,3.n. Our proof depends on Kleitman's results for the complete bipartite graphs [D. J. Kleitman, The crossing number of K5,n. J. Combhatorial Theory 9 (1970) 375-3231. a graph G is the minimum numbe
## Abstract The crossing number of __K~n~__ is known for __n__ ⩽ 10. We develop several simple counting properties that we shall exploit in showing by computer that __cr__(__K__~11~ = 100, which implies that __cr__(__K__~12~) = 150. We also determine the numbers of non‐isomorphic optimal drawings o
Our main result is that a 1971 conjecture due to Paul Kainen is false. Kainen's conjecture implies that the genus 2 crossing number of K 9 is 3. We disprove the conjecture by showing that the actual value is 4. The method used is a new one in the study of crossing numbers, involving proof of the imp