✦ LIBER ✦

New Bounds on Crossing Numbers

✍ Scribed by Pach, J.; Spencer, J.; Tóth, G.

Book ID: 113044324
Publisher: Springer
Year: 2000
Tongue: English
Weight: 141 KB
Volume: 24
Category: Article
ISSN: 0179-5376
DOI: 10.1007/s004540010011

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 __

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

New results on rectilinear crossing numb

New results on rectilinear crossing numbers and plane embeddings

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

## Abstract We show that if a graph has maximum degree __d__ and crossing number __k__, its rectilinear crossing number is at most __O__(__dk__^2^). Hence for graphs of bounded degree, the crossing number and the rectilinear crossing number are bounded as functions of one another. We also obtain a

Improved Bounds for the Crossing Numbers

Improved Bounds for the Crossing Numbers of Km,n and Kn

✍ de Klerk, E.; Maharry, J.; Pasechnik, D. V.; Richter, R. B.; Salazar, G. 📂 Article 📅 2006 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 208 KB

New Upper Bounds for Ramsey Numbers

✍ Y.R Huang; K.M Zhang 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 79 KB

The Ramsey number R(G 1 , G 2 ) is the smallest integer p such that for any graph Some new upper bound formulas are obtained for R(G 1 , G 2 ) and R(m, n), and we derive some new upper bounds for Ramsey numbers here.

On k-planar crossing numbers

✍ Farhad Shahrokhi; Ondrej Sýkora; László A. Székely; Imrich Vrt’o 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 197 KB