Article ID Journal Published Year Pages File Type
4654083 European Journal of Combinatorics 2011 9 Pages PDF
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.
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Maximal independent sets in bipartite graphs obtained from Boolean lattices
Authors
, , ,