Maximal independent sets in bipartite graphs obtained from Boolean lattices

详细信息    查看全文

• 作者：Dwight Duffus ; Peter Frankl ; Vojtě ; ch Rö ; dl
• 刊名：European Journal of Combinatorics
• 出版年：2011
• 出版时间：January 2011
• 年：2011
• 卷：32
• 期：1
• 页码：1-9
• 全文大小：241 K

文摘

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.