Incomparable copies of a poset in the Boolean lattice.
From MaRDI portal
Publication:890018
DOI10.1007/s11083-014-9342-8zbMath1326.06007arXiv1309.7379OpenAlexW2153795850MaRDI QIDQ890018
Dániel T. Nagy, Gyula O. H. Katona
Publication date: 9 November 2015
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.7379
Related Items
Cites Work
- Unnamed Item
- A Sperner theorem on unrelated chains of subsets
- Diamond-free families
- Packing posets in the Boolean lattice.
- On diamond-free subposets of the Boolean lattice
- Set families with a forbidden subposet
- Largest families without an \(r\)-fork
- On Families of Subsets With a Forbidden Subposet
- On generalized graphs
- On a lemma of Littlewood and Offord