Maximal antichains of subsets II: Constructions

MaRDI QIDQ6369414zbMATH OpenFDO

Authors J. Griggs, Thomas Kalinowski, Uwe Leck, Ian T. Roberts, Michael Schmitz

Publication date 3 June 2021

Mathematics Subject Classification ID

Extremal set theory (05D05) Combinatorics of partially ordered sets (06A07)

Abstract: This is the second in a sequence of three papers investigating the question for which positive integers $m$ there exists a maximal antichain of size $m$ in the Boolean lattice $B_n$ (the power set of $[n]:=1,2,dots,n$, ordered by inclusion). In the previous paper we characterized those $m$ between $$ and the maximum size $$ that are not sizes of maximal antichains. In this paper we show that all smaller $m$ are sizes of maximal antichains.

This page was built for publication: Maximal antichains of subsets II: Constructions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6369414)