Connectivity of chamber graphs of buildings and related complexes (Q710737)

Buildings are highly symmetric simplicial complexes. Chambers are the maximal simplices. If at least \(q\) pairwise disjoint paths connect any pair of chambers then the chamber graph is said to be \(q\)-connected. Let \(s\) denote the number of chambers adjacent to any given chamber of a thick 2-spherical and locally finite building \(B\). The author proves that the chamber graph of \(B\) is \(s\)-connected. Since more than \(s\) independent paths cannot leave a chamber, the result is sharp. This implies that s is the exact degree of connectivity of the chamber graph. The study of chamber graphs is extended to order complexes of general geometric lattices, and a lower bound on the connectivity of the chamber graphs of those complexes is established.