Title of article
Maximal independent sets in bipartite graphs obtained from Boolean lattices
Author/Authors
Duffus، نويسنده , , Dwight and Frankl، نويسنده , , Peter and R?dl، نويسنده , , Vojt?ch، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2011
Pages
9
From page
1
To page
9
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.
Journal title
European Journal of Combinatorics
Serial Year
2011
Journal title
European Journal of Combinatorics
Record number
1546225
Link To Document