A partially ordered set P is called a k-sphere order if one can assign to each element a ∈ P a ball Ba in Rk so that a < b iff Ba ⊂ Bb. To a graph G = (V,E) associate a poset P(G) whose elements are the vertices and edges of G. We have v < e in P(G) exactly when v ∈ V, e ∈ E, and v is an end point of e. We show that P(G) is a 3-sphere order for any graph G. It follows from E. R. Scheinerman [“A Note on Planar Graphs and Circle Orders,” SIAM Journal of Discrete Mathematics, Vol. 4 (1991), pp. 448–451] that the least k for which G embeds in Rk equals the least k for which P(G) is a k-sphere order. For a simplicial complex K one can define P(K) by analogy to P(G) (namely, the face containment order). We prove that for each 2-dimensional simplicial complex K, there exists a k so that P(K) is a k-sphere order. © 1993 John Wiley & Sons, Inc.
[1]
Graham R. Brightwell,et al.
Representations of Planar Graphs
,
1993,
SIAM J. Discret. Math..
[2]
Edward R. Scheinerman,et al.
A Note on Planar Graphs and Circle Orders
,
1991,
SIAM J. Discret. Math..
[3]
W. Schnyder.
Planar graphs and poset dimension
,
1989
.
[4]
D. Meyer.
The Dimension of Causal Sets II: Hausdorff Dimension
,
1989
.
[5]
Edward R. Scheinerman,et al.
On circle containment orders
,
1988
.
[6]
Glenn H. Hurlbert,et al.
A short proof that N3 is not a circle containment order
,
1988
.
[7]
Jorge Urrutia,et al.
Circle orders, N-gon orders and the crossing number
,
1988
.
[8]
W. Thurston.
The geometry and topology of three-manifolds
,
1979
.