On the stable crossing number of cubes
暂无分享,去创建一个
Very few results are known which yield the crossing number of an infinite class of graphs on some surface. In this paper it is shown that by taking the class of graphs to be d-dimensional cubes Q(d) and by allowing the genus of the surface to vary, we obtain upper and lower bounds on the crossing numbers which are independent of d. Specifically, if the genus of the surface is always y(Q(d))-k, where y(Q(d)) is the genus of Q(d) and k is a fixed nonnegative integer, then 4k<cry(Q(d))_ (Q(d))<8k provided that k is not too large compared to d. 0. Introduction. In this paper, we shall deal only with finite graphs without loops or parallel edges. If G is a graph, we denote by V(G) its set of vertices and E(G) its set of edges. By linear algebra, we can realize any graph G as a subset of three-dimensional euclidean space-simply put the set V(G) of vertices in general position (no 3 collinear, no 4 coplanar) and put in the edges of E(G) as straight line segments. Obviously, any two such realizations, with the subspace topologies, are homeomorphic. By the surface Xg of genus g, g_0, we mean the closed orientable 2manifold obtained by attaching g handles to the sphere-e.g., ElX=torus. An immersion q of G in Eg is a continuous map q:G--Xg which is an imbedding restricted to 9-1(9(V(G))) and such that, for ally EE X, the set 9-1(y) contains at most two points. If an immersion is 1-1, we call it an imbedding of the graph. The image of 9, im q or q(G), isjust {y E XZjy= q(x) for some x E G}. This amounts to drawing the graph on the surface so that all vertices are distinct, two edges which intersect each other meet at either a common endpoint or at a point on the interior of both edges, and at most two edges intersect at any interior point. For technical reasons, we shall prefer to deal only with piecewise-linear (PL) immersions. Recall that a mapf: IKI-*ILI, where K and L are finite simplicial complexes with geometric realizations IKI and ILI, is simplicial when it carries simplexes linearly into simplexes and is PL when there are Received by the editors February 19, 1971 and, in revised form, March 1, 1972. AMS 1970 subject class{fications. Primary 05C10; Secondary 55A15.
[1] L. Beineke,et al. The Genus of the n-Cube , 1965, Canadian Journal of Mathematics.
[2] E. C. Zeeman,et al. Seminar on combinatorial topology , 1963 .
[3] Paul C. Kainen,et al. A lower bound for crossing numbers of graphs with applications to Kn, Kp,q, and Q(d) , 1972 .
[4] G. Ringel. Über drei kombinatorische Probleme amn-dimensionalen Würfel und Würfelgitter , 1955 .