𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Crossing Number of P(N, 3)

✍ Scribed by R. Bruce Richter; Gelasio Salazar


Publisher
Springer Japan
Year
2002
Tongue
English
Weight
166 KB
Volume
18
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


The crossing number ofK3,n in a surface
✍ Richter, R. Bruce; ?irοΏ½?, J. πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 174 KB

In this article, w e show that the crossing number of K3," in a surface with Euler genus . This generalizes a result of Guy and Jenkyns, who obtained this result for the torus. 0

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

Bounds for the crossing number of the N-
✍ Tom Madej πŸ“‚ Article πŸ“… 1991 πŸ› John Wiley and Sons 🌐 English βš– 658 KB

## Abstract Let __Q__~__n__~ denote the n‐dimensional hypercube. In this paper we derive upper and lower bounds for the crossing number __v__(__Q__~__n__~), i.e., the minimum number of edge‐crossings in any planar drawing of __Q__~__n__~. The upper bound is close to a result conjectured by Eggleton

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.

The projective plane crossing number of
✍ Adrian Riskin πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 510 KB

## Abstract In this paper, we show that the projective plane crossing number of the graphs __C__~3~ Γ— __C__~__n__~ is __n__ ‐ 1 for __n__ ≀ 5 and 2 for __n__ = 4. As far as we can tell from the literature, this is the first infinite family of graphs whose crossing number is known on a single surfac