✦ LIBER ✦

Expected Crossing Numbers

✍ Scribed by Bojan Mohar; Tamon Stephen

Book ID: 119236627
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 188 KB
Volume: 38
Category: Article
ISSN: 1571-0653
DOI: 10.1016/j.endm.2011.10.009

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Expected Frobenius numbers

✍ Iskander Aliev; Martin Henk; Aicke Hinrichs 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 136 KB

Degenerate Crossing Numbers

✍ János Pach; Géza Tóth 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 256 KB

On stable crossing numbers

✍ Paul C. Kainen; Arthur T. White 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 253 KB

## Abstract Results giving the exact crossing number of an infinite family of graphs on some surface are very scarce. In this paper we show the following: for __G__ = __Q__~__n__~ × __K__~4.4~, cr~__y__(__G__)‐__m__~(__G__) = 4__m__, for 0 ⩽ = __m__ ⩽ 2^__n__^. A generalization is obtained, for cer

Expected numbers at hitting times

✍ Colin McDiarmid 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 348 KB

## Abstract We determine exactly the expected number of hamilton cycles in the random graph obtained by starting with __n__ isolated vertices and adding edges at random until each vertex degree is at least two. This complements recent work of Cooper and Frieze. There are similar results concerning

New Bounds on Crossing Numbers

✍ Pach, J.; Spencer, J.; Tóth, G. 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 141 KB

Bounds for rectilinear crossing numbers

✍ Daniel Bienstock; Nathaniel Dean 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 780 KB

## Abstract A rectilinear drawing of a graph is one where each edge is drawn as a straight‐line segment, and the rectilinear crossing number of a graph is the minimum number of crossings over all rectilinear drawings. We describe, for every integer __k__ ≥ 4, a class of graphs of crossing number __