A Note on Planar and Dismantlable Lattices

Simple item page
dc.creatorCollins, Karen L.
dc.date2000-06-19
dc.date.accessioned2026-07-07T04:35:56Z
dc.date.available2026-07-07T04:35:56Z
dc.descriptionIt 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.
dc.description5 pages
dc.identifierhttps://arxiv.org/abs/math/0006131
dc.identifierhttp://arxiv.org/abs/math/0006131
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/59430
dc.subjectCombinatorics
dc.subject06A; 05A
dc.titleA Note on Planar and Dismantlable Lattices
dc.typetext

Files

Collections

arXiv