Mathematics – Combinatorics
Scientific paper
2000-06-19
Mathematics
Combinatorics
5 pages
Scientific paper
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.
No associations
LandOfFree
A Note on Planar and Dismantlable Lattices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Note on Planar and Dismantlable Lattices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Note on Planar and Dismantlable Lattices will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-598556