The saturation spectrum for antichains of subsets
From MaRDI portal
Publication:6139859
Abstract: Extending a classical theorem of Sperner, we characterize the integers such that there exists a maximal antichain of size in the Boolean lattice , that is, the power set of , 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 and , we ask which integers have the property that there exists a family of -sets with such that the shadow of has size , where the shadow of is the collection of -sets that are contained in at least one member of . We provide a complete answer for . Moreover, we prove that the largest integer which is not the shadow size of any family of -sets is .
Cites work
- scientific article; zbMATH DE number 3685495 (Why is no real title available?)
- scientific article; zbMATH DE number 3489128 (Why is no real title available?)
- scientific article; zbMATH DE number 1792287 (Why is no real title available?)
- scientific article; zbMATH DE number 7272503 (Why is no real title available?)
- scientific article; zbMATH DE number 3189757 (Why is no real title available?)
- A survey of minimum saturated graphs
- Computationally efficient bounds for the Catalan numbers
- Induced and non-induced poset saturation problems
- Maximal antichains of minimum size
- Maximal flat antichains of minimum weight
- Minimum shadows in uniform hypergraphs and a generalization of the Takagi function
- Minimum weight flat antichains of subsets
- On saturated \(k\)-Sperner systems
- Saturating Sperner families
- Size in maximal triangle-free graphs and minimal graphs of diameter 2
- Supersaturation and stability for forbidden subposet problems.
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)