Minimising the total number of subsets and supersets
From MaRDI portal
Publication:6201877
DOI10.1016/j.ejc.2023.103882arXiv2212.13112OpenAlexW4388839473MaRDI QIDQ6201877
Adam Gowty, Daniel Horsley, Adam Mammoliti
Publication date: 26 March 2024
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2212.13112
Exact enumeration problems, generating functions (05A15) Extremal set theory (05D05) Distance in graphs (05C12)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On cloud-antichains and related configurations
- A new short proof for the Kruskal-Katona theorem
- Shadows and intersections: Stability and new proofs
- Stability for vertex isoperimetry in the cube
- Uniqueness in Harper's vertex-isoperimetric theorem
- Vertex-isoperimetric stability in the hypercube
- On minimisation of the double-sided shadow in the unit cube
- Nonexistence of a Kruskal–Katona type theorem for double-sided shadow minimization in the Boolean cube layer
- Cross-sperner families
- Optimal numberings and isoperimetric problems on graphs
This page was built for publication: Minimising the total number of subsets and supersets