Sizes of Flat Maximal Antichains of Subsets

Jerrold R. Griggs, Thomas Kalinowski, Uwe Leck, Ian T. Roberts, Michael Schmitz

Research output: Contribution to journalArticlepeer-review

58 Downloads (Pure)

Abstract

This is the second of two papers investigating for which positive integers m there exists a maximal antichain of size m in the Boolean lattice Bn (the power set of [n]:={1,2,⋯,n}, ordered by inclusion). In the first part, the sizes of maximal antichains have been characterized. Here we provide an alternative construction with the benefit of showing that almost all sizes of maximal antichains can be obtained using antichains containing only l-sets and (l+1)-sets for some l.

Original languageEnglish
Pages (from-to)1-26
Number of pages26
JournalOrder
DOIs
Publication statusE-pub ahead of print - 27 Jun 2024

Fingerprint

Dive into the research topics of 'Sizes of Flat Maximal Antichains of Subsets'. Together they form a unique fingerprint.

Cite this