The saturation spectrum for antichains of subsets

From MaRDI portal
Publication:6139859

DOI10.1007/S11083-022-09622-6arXiv2106.02226MaRDI QIDQ6139859FDOQ6139859


Authors:


Publication date: 19 December 2023

Published in: Order (Search for Journal in Brave)

Abstract: Extending a classical theorem of Sperner, we characterize the integers m such that there exists a maximal antichain of size m in the Boolean lattice Bn, that is, the power set of [n]:=1,2,dots,n, ordered by inclusion. As an important ingredient in the proof, we initiate the study of an extension of the Kruskal-Katona theorem which is of independent interest. For given positive integers t and k, we ask which integers s have the property that there exists a family mathcalF of k-sets with lvertmathcalFvert=t such that the shadow of mathcalF has size s, where the shadow of mathcalF is the collection of (k1)-sets that are contained in at least one member of mathcalF. We provide a complete answer for tleqslantk+1. Moreover, we prove that the largest integer which is not the shadow size of any family of k-sets is sqrt2k3/2+sqrt[4]8k5/4+O(k).


Full work available at URL: https://arxiv.org/abs/2106.02226







Cites Work


Cited In (1)





This page was built for publication: The saturation spectrum for antichains of subsets

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