Antichain cutsets of strongly connected posets
classification
🧮 math.CO
keywords
antichainconnectedcutsetsfinitelatticesstronglycharacterizationlocally
read the original abstract
Rival and Zaguia showed that the antichain cutsets of a finite Boolean lattice are exactly the level sets. We show that a similar characterization of antichain cutsets holds for any strongly connected poset of locally finite height. As a corollary, we get such a characterization for semimodular lattices, supersolvable lattices, Bruhat orders, locally shellable lattices, and many more. We also consider a generalization to strongly connected hypergraphs having finite edges.
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.