A Note on Planar and Dismantlable Lattices
Combinatorics
2007-05-23 v1
Abstract
It is shown that any finite, rank-connected, dismantlable lattice is lexicographically shellable (hence Cohen-Macaulay). A ranked, interval-connected lattice is shown to be rank-connected, but a rank-connected lattice need not be interval-connected. An example of a planar, rank-connected lattice that is not admissible is given.
Keywords
Cite
@article{arxiv.math/0006131,
title = {A Note on Planar and Dismantlable Lattices},
author = {Karen L. Collins},
journal= {arXiv preprint arXiv:math/0006131},
year = {2007}
}
Comments
5 pages