Are there examples of d-regular graphs (i.e. graphs where every node has exactly d adjacent nodes) which are not the 1-skeleton of a simple convex polytope?


UPDATE:


New version of the question: is there an example of a d-dimensional "simple" poset, i.e. a collection of k-dimensional "faces" with $k=0, 1, \dots, d$ equipped with partial ordering such that its 1-dimensional skeleton is a d-regular graph, which is not the face lattice of a convex polytope? (Obviously the partial order is to be interpreted as $X < Y$ if $X$ is contained in the 
boundary of $Y$).


It seems to be that the graph of the previous answer ($K\_{3,3}$) cannot be interpreted as the 1-skeleton of a 3-dimensional simple poset. 


NEW UPDATE:


By convex polytope I mean the intersection of several half-spaces given by linear inequalities. The boundaries of a convex polytope are themselves convex polytopes, the full collection of these boundaries of any co-dimension define the face lattice of the polytope.


We can represent the combinatorics of the face lattice of a d-dimensional convex polytope by giving the collection of its facets $F=\{X\_1, \dots, X\_F\}$ and vertices $V=(v\_1, \dots, v\_n)$ and representing each vertex as the intersection of at least $d$ facets, e.g. we can write $v\_j = (X\_{j\_1}, \dots, X\_{j\_d})$ to say that vertex $v$ lies in the intersection of faces $X\_{j\_1}, \dots, X\_{j\_d}$. In particular if the polytope is simple, every vertex will be presented as the intersection of $precisely$ $d$ facets. I am only interested in this case, so let me assume that the set $V$ is always a set of $d$-tuples of elements in $F$.


From this data, we can read all the face lattice structure: two facets $X\_a$ and $X\_b$ intersect in the polytope if and only if there is at least one vertex containing both. Each facet $X\_a$ is itself a polytope whose combinatorial data can be presented in the same way, i.e. by listing all the facets $X\_b$ intersecting with $X\_a$ and all the vertices lying on $X\_a$. Clearly we can iterate down to any dimension.


Now suppose you are given a set of data $(F,V)$, and you are asked to understand wether there exists a simple polytope whose face lattice is given by $(F,V)$. You can do a number of combinatorical and topological checks on $(F,V)$: you can compute the euler characteristic and check that is 1, or you can compute all the homological groups of $(F,V)$ and see that they are compatible with those of a convex set. Admittedly, I do not know what is the set of $all$ checks one can do before trying to find an actual convex realisation of the polytope...
My question is: is there a counterexample of a set of data $(F,V)$ that meets all these criteria, but is known not to arise from a simple convex polytope?


SUMMARY OF PREVIOUS ANSWERS:


David Speyer:


The 0-faces are the vertices (1,2,3,-1,-2,-3). Higher dimensional facets are represented by giving the vertices lying on them.
The 3-faces are the five element sets (1,2,−2,3,−3), (−1,2,−2,3,−3), (1,−1,2,3,−3), and (1,−1,−2,3,−3). The 2-faces are (2,−2,3,−3), (1,−1,3,−3) and the eight three-element sets of the form (±1,±2,±3). The 1-faces are the 12 pairs (i,j) with i≠−j.


In this answer the 3-face $(1,2,-2,3,-3)$ it's not a simple polytope, since the vertex 1 is adjacent to more than 3 vertices.


M. Winter:


1) In the hemicube there are three faces $F=\{X\_1,X\_2,X\_3\}$ and each vertex is presented as their intersection $v = (X\_1,X\_2,X\_3)$. So $(F,V)$ cannot arise from a 3-dimensional convex polytope which must have at least 4 vertices.
2) The hemidodecagon is trickier, we have 6 facets $F=\{X\_1, \dots, X\_6\}$ and 10 vertices $V=\{(X\_1,X\_2,X\_4), (X\_1,X\_2,X\_6), (X\_1,X\_3,X\_4), (X\_1,X\_3,X\_5), (X\_1,X\_5,X\_6), (X\_2,X\_3,X\_5), (X\_2,X\_3,X\_6), (X\_2,X\_4,X\_5), (X\_3,X\_4,X\_6), (X\_4,X\_5,X\_6)\}$. The putative polytope should be 3-dimensional, but from $(F,V)$ we can read an obstruction: start from vertex 1 and orient the facets incident there as $(X\_1 \to X\_2 \to X\_4)$, jump to the vertex 2 and to be consistent with the previous orientation now the faces have to be oriented as $(X\_1 \to X\_6 \to X\_2)$, but is impossible to find an orientation at each vertex consistent with this jump rule. 



An example of a "simple poset" which does not belong to a convex polytope
I think a counterexample can be obtained via [simplicial spheres](https://en.m.wikipedia.org/wiki/Simplicial_sphere). It is known that in higher dimensions, most simplicial spheres do not belong to a polytope. The dual of the face lattice of such a $d$-dimensional non-polytopal simplicial sphere is a $d$-regular "simple" poset in your sense, and cannot belong to a $d$-polytope (as otherwise, the original poset would too). However, it is not clear that the graph of such a poset does not belong to a $d$-polytope either.


Another approach that comes to my mind are [abstract polytopes](https://en.m.wikipedia.org/wiki/Abstract_polytope) which are defined purely in term of posets. Here, I have two explicit 3-dimensional examples from the class of [projective polyhedra](https://en.m.wikipedia.org/wiki/Projective_polyhedron):


* the face structure of the [hemi cube](https://en.m.wikipedia.org/wiki/Hemicube_(geometry)) does not belong to a polyhedron, but its graph is $K\_4$, which does belong to the tetrahedron.
* the [hemi dodecahedron](https://en.m.wikipedia.org/wiki/Hemi-dodecahedron) cannot be realized as a polyhedron. Its graph is the [Petersen graph](https://en.m.wikipedia.org/wiki/Petersen_graph), which is not planar and hence cannot belong to a polyhedron either (in fact, it cannot belong to *any* convex polytope). Its poset can be construct quite easily from the face lattice of the dodecahedron by identifying antipodal faces.


Similar examples can be obtained from all centrally symmetric simple polytopes.


