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 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 .
Full work available at URL: https://arxiv.org/abs/2106.02226
Cites Work
- A survey of minimum saturated graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computationally efficient bounds for the Catalan numbers
- Title not available (Why is that?)
- Maximal flat antichains of minimum weight
- Saturating Sperner families
- On saturated \(k\)-Sperner systems
- Minimum shadows in uniform hypergraphs and a generalization of the Takagi function
- Size in maximal triangle-free graphs and minimal graphs of diameter 2
- Supersaturation and stability for forbidden subposet problems.
- Induced and non-induced poset saturation problems
- Maximal antichains of minimum size
- Minimum weight flat antichains of subsets
- Title not available (Why is that?)
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)