Connectivity of chamber graphs of buildings and related complexes

Details Connectivity of chamber graphs of buildings and related complexes Connectivity of chamber graphs of buildings and related complexes

2009-07-02

arxiv.org/abs/0907.0325v1

Mathematics

Combinatorics

14 pages, 9 figures

Scientific paper

Let \Delta be a finite building (or, more generally, a thick spherical and locally finite building). The chamber graph G(\Delta), whose edges are the pairs of adjacent chambers in \Delta, is known to be q-regular for a certain number q=q(\Delta). Our main result is that G(\Delta) is q-connected in the sense of graph theory. Similar results are proved for the chamber graphs of Coxeter complexes and for order complexes of geometric lattices.

Affiliated with

Also associated with

No associations

Rating

Connectivity of chamber graphs of buildings and related complexes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Connectivity of chamber graphs of buildings and related complexes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Connectivity of chamber graphs of buildings and related complexes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-730728