Cell structure of mediangle graphs

Abstract

Mediangle graphs are a common generalization of median graphs (1-sekeleta of CAT(0) cube complexes) and Coxeter graphs (Cayley graphs of Coxeter systems). Answering a question motivated from geometric group theory, we show that these graphs can be endowed with the structure of a contractible cell complex. We further show that the cells of this complex are products of simplices and simplicial oriented matroids. A crucial part of the proof identifies bipartite mediangle graphs as tope graphs of finitary Complexes of Oriented Matroids.