The 2-Page Crossing Number of(K_{n})
✍ Scribed by Bernardo M. Ábrego, Oswin Aichholzer…
- Book ID
- 120910258
- Publisher
- Springer
- Year
- 2013
- Tongue
- English
- Weight
- 859 KB
- Volume
- 49
- Category
- Article
- ISSN
- 0179-5376
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
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
## 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