Let $\{ G\_n \}\_{n \ge 1}$ be a sequence of graphs such that the number of vertices of $G\_n$ tends to $\infty$ as $n \to \infty$. We say that $\{ G\_n \}\_{n \ge 1}$ is an [expander family](http://en.wikipedia.org/wiki/Expander_graph) if
$\lambda\_2( G\_n)$ is bounded away from $0$ as $n \to \infty$. Here $\lambda\_2(H)$ is the smallest positive eigenvalue of the normalized [graph Laplacian](http://en.wikipedia.org/wiki/Laplacian_matrix) of $H$.


If every $G\_n$ is the $1$-skeleton of a [simple $3$-polytope](http://en.wikipedia.org/wiki/Simple_polytope), you can not have an expander family. This follows from the [planar separator theorem](http://en.wikipedia.org/wiki/Planar_separator_theorem).


What if every $G\_n$ is the $1$-skeleton of a simple $4$-polytope? If you relax "simple" then there are obvious examples — in particular, [cyclic polytopes](http://en.wikipedia.org/wiki/Cyclic_polytope) in dimension $4$ have complete graphs for their $1$-skeletons, so they are expanders.


If it is hard to come up with an example for simple $4$-polytope, does it make it easier if we allow the dual graph of an arbitrary [simplicial $3$-sphere](http://en.wikipedia.org/wiki/Simplicial_sphere)?



Do there exist "expanding" $1$-skeletons of simple $4$-polytopes?
As far as I know there are no examples of graphs of simple 4-polytopes (or simple $d$-polytopes, for fixed $d$) that are expanders, and not even such examples for the dual graphs for triangulations of spheres of fixed dimensions. Some information on expansion properties of graphs of polytopes can be found in my chapter [polytope skeletons and paths](http://www.ma.huji.ac.il/~kalai/ch19.pdf) of the Handbook of Discrete and Computational Geometry (Goodman and O'Rourke, eds.). 


There is a conjecture that graphs of polytopes are not very good expanders: Let $d$ be fixed. The conjecture asserts that a graph of every simple $d$-polytope with $n$ vertices 
can be separated into two parts, each having at least $n/3$ vertices by removing $O(n^{1-1/(d-1)})$ vertices.


This is known to be false for dual graphs to triangulations. It is known that there are dual graphs to triangulations of $S^3$ which cannot be separated even by $O(n / \log n)$ vertices. This is a construction from G. L. Miller, S.-H. Teng, W. Thurston, and S. A. Vavasis. "Separators for sphere packings and nearest neighbor graphs." *J. ACM*, 44(1):1-29, 1997. ([PDF download](http://www.cs.bu.edu/~steng/teaching/Fall2005/cs532/jacm.pdf)) (I would be happy to see a nice exposition of this construction.)


On the positive side it is known that dual to neighborly $d$ polytopes with $n$ facets are $\epsilon$-expanders for $\epsilon =n^{-4}$. This is far from the good expansion in the question but good enough to give a polynomial upper bound in $n$ for the diameter. Unfortunately general simple $d$ polytopes can be fairly poor expanders as seen by gluing two large simplicial polytopes along a facet and taking the dual. 


