Improved bounds for cross-Sperner systems
From MaRDI portal
Publication:6126447
DOI10.37236/11860arXiv2302.02516OpenAlexW4394934440MaRDI QIDQ6126447
Natasha Morrison, Akina Kuperus, Natalie C. Behague, Ashna Wright
Publication date: 9 April 2024
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2302.02516
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Saturating Sperner families
- A random version of Sperner's theorem
- The exact bound in the Erdős-Ko-Rado theorem for cross-intersecting families
- Maximal flat antichains of minimum weight
- Maximum antichains in random subsets of a finite set
- Cross-intersecting families of finite sets
- Maximum-size antichains in random set-systems
- On incomparable collections of sets
- Set Systems Containing Many Maximal Chains
- Cross-sperner families
- Families of Non-disjoint subsets
- On a conjecture of milner on k-graphs with non-disjoint edges
- A new generalization of the Erdős-Ko-Rado theorem
- The saturation spectrum for antichains of subsets
- Minimising the total number of subsets and supersets
