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.
References
Status
- Solved: Patricia Hersh. Shelling Coxeter-like Complexes and Sorting on Trees (arXiv, 2008) https://arxiv.org/abs/0809.2414
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
No solutions have been posted yet.