Finite Dismantlable Semidistributive Lattices are Planar
classification
🧮 math.CO
keywords
finitelatticessemidistributivedismantlablebreadthplanarresultarticle
read the original abstract
In this article, we prove that finite semidistributive lattices are dismantlable if and only if they are planar. This extends a well-known result by Kelly and Rival that states the same property for finite distributive lattices. Moreover, we show how the breadth of finite semidistributive lattices can be computed with the help of canonical join representations. We use this result to conclude that the breadth of a finite semidistributive dismantlable lattice cannot exceed $2$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.