Abstract
Attempts to enumerate maximal antichains in Boolean lattices give rise to problems involving maximal independent sets in bipartite graphs whose vertex sets are comprised of adjacent levels of the lattice and whose edges correspond to proper containment. In this paper, we find bounds on the numbers of maximal independent sets in these graphs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have