Babson–Reiner connectivity conjecture for Coxeter-like complexes
Babson–Reiner connectivity conjecture for Coxeter-like complexes
Let be a tree with nodes and leaves, and let be its Coxeter-like complex. Babson–Reiner conjecture. The complex is at least -connected. The paper states that this conjecture is proved in its Theorem, so it is solved; it generalizes connectivity results for chessboard complexes and type A Coxeter complexes.
Sources & referencesView supporting material
Primary source
Patricia Hersh, “Shelling Coxeter-like Complexes and Sorting on Trees”, arXiv:0809.2414 (2008).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.