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