a graph $x$ is defined inductively to be $(a_0, . . . , a_{n−1})$-regular if $x$ is $a_0$-regular and for every vertex $v$ of $x$, the sphere of radius 1 around $v$ is an $(a_1, . . . , a_{n−1})$-regular graph. a family $f$ of graphs is said to be an expander family if there is a uniform lower bound on the cheeger constant of all the graphs in $f$. 

after briefly (re)introducing coxeter groups and their geometries, we will describe how they can be used to construct very regular polytopes, which in turn can yield highly regular graphs. we will then use the super-approximation machinery, whenever the coxeter group is hyperbolic, to obtain the expansion of these family of graphs. as a result, we obtain interesting infinite families of highly regular expander graphs, some of which are related to the exceptional groups. 

the talk is based on work joint with conder, lubotzky and schillewaert.