← All problems

Babson–Reiner connectivity conjecture for Coxeter-like complexes

18 years old · traced to

Let TT be a tree with nn nodes and bb leaves, and let cDeltaTcDelta_T be its Coxeter-like complex. Babson–Reiner conjecture. The complex cDeltaTcDelta_T is at least (n−1−b)(n-1-b)-connected.

References

Status

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.