Patricia Hersh
Published 2003-11-16Version 1
This paper verifies a conjecture of Edelman and Reiner regarding the homology of the $h$-complex of a Boolean algebra. A discrete Morse function with no low-dimensional critical cells is constructed, implying a lower bound on connectivity. This together with an Alexander duality result of Edelman and Reiner implies homology-vanishing also in high dimensions. Finally, possible generalizations to certain classes of supersolvable lattices are suggested.
The rainbow $k$-connectivity of two classes of graphs
Connectivity and choosability of graphs with no $K_t$ minor
On the Sombor index of graphs with given connectivity and number of bridges
![QR code for arXiv:math/0311271 [math.CO]](http://oss.arxitics.com/images/favicon.svg)