✦ LIBER ✦

The genus 2 crossing number of K9

✍ Scribed by Adrian Riskin

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 716 KB
Volume: 145
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)00037-j

No coin nor oath required. For personal study only.

✦ Synopsis

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 impossibility of certain genus 2 embeddings of Ks.

📜 SIMILAR VOLUMES

The crossing number of K11 is 100

✍ Shengjun Pan; R. Bruce Richter 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 121 KB

## 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

The crossing number of K1,3,n and K2,3,n

✍ Kouhei Asano 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 234 KB

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

The genus of Kn − K2

✍ Mark Jungerman 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 324 KB

The genus theory of number fields

✍ H. M. Stark 📂 Article 📅 1976 🏛 John Wiley and Sons 🌐 English ⚖ 277 KB 👁 1 views

The crossing number of c4 × c4

✍ Alice M. Dean; R. Bruce Richter 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 210 KB

We prove t h a t t h e crossing number of C4 X Ca is 8.

The Crossing Number of a Graph on a Comp

The Crossing Number of a Graph on a Compact 2-Manifold

✍ F. Shahrokhi; O. Sýkora; L.A. Székely; I. Vrťo 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 478 KB

We introduce a general framework to estimate the crossing number of a graph on a compact 2-manifold in terms of the crossing number of the complete graph of the same size on the same manifold. The bounds are tight within a constant multiplicative factor for many graphs, including hypercubes, some co