Incomparable copies of a poset in the Boolean lattice.

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

zbMATH Keywords

finite posetsSperner theoremincomparable copiesnumbers of embeddings

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Extremal set theory (05D05)

Related Items

On Generalized Turán Results in Height Two Posets, Packing posets in the Boolean lattice.

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