Packing posets in the Boolean lattice.

DOI10.1007/s11083-014-9343-7zbMath1327.06004arXiv1309.6686OpenAlexW2041088912MaRDI QIDQ890020

Jerrold R. Griggs, Andrew P. Dove

Publication date: 9 November 2015

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1309.6686

zbMATH Keywords

Boolean latticefinite posetsSperner theoremincomparable copiesnumbers of embeddingspacking posets

Mathematics Subject Classification ID

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

Related Items (2)

On Generalized Turán Results in Height Two Posets ⋮ Incomparable copies of a poset in the Boolean lattice.

Cites Work

• Unnamed Item
• A Sperner theorem on unrelated chains of subsets
• Diamond-free families
• Incomparable copies of a poset in the Boolean lattice.
• On diamond-free subposets of the Boolean lattice
• On generalized graphs
• A short proof of Sperner's lemma

This page was built for publication: Packing posets in the Boolean lattice.