✦ LIBER ✦

Odd Crossing Number and Crossing Number Are Not the Same

✍ Scribed by Michael J. Pelsmajer; Marcus Schaefer; Daniel Štefankovič

Publisher: Springer
Year: 2008
Tongue: English
Weight: 331 KB
Volume: 39
Category: Article
ISSN: 0179-5376
DOI: 10.1007/s00454-008-9058-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The crossing number ofC5 �Cn

✍ Kle??, Mari�n; Richter, R. Bruce; Stobert, Ian 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 276 KB

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.

On the crossing number ofcm �cn

✍ Salazar, Gelasio 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 75 KB

which has been proved only for m ≤ 6.

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.

Note on the Pair-crossing Number and

✍ Géza Tóth 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 331 KB

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

An improvement of the crossing number bo

An improvement of the crossing number bound

✍ Bernard Montaron 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 194 KB

## Abstract The crossing number __cr__(__G__) of a simple graph __G__ with __n__ vertices and __m__ edges is the minimum number of edge crossings over all drawings of __G__ on the ℝ^2^ plane. The conjecture made by Erdős in 1973 that __cr__(__G__) ≥ __Cm__^3^/__n__^2^ was proved in 1982 by Leighton