Packing posets in the Boolean lattice.

DOI10.1007/S11083-014-9343-7MaRDI QIDQ890020zbMATH OpenOpenAlexFDO

Authors Andrew P. Dove, J. Griggs

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

finite posetsSperner theoremBoolean latticeincomparable copiesnumbers of embeddingspacking posets

Mathematics Subject Classification ID

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

Abstract: We are interested in maximizing the number of pairwise unrelated copies of a poset $P$ in the family of all subsets of $[n]$. We prove that for any $P$ the maximum number of unrelated copies of $P$ is asymptotic to a constant times the largest binomial coefficient. Moreover, the constant has the form $frac1c(P)$, where $c(P)$ is the size of the smallest convex closure over all embeddings of $P$ into the Boolean lattice.

Recommendations

• Incomparable copies of a poset in the Boolean lattice.
• Packing the Boolean lattice with copies of a poset
• Packing and covering k-chain free subsets in Boolean lattices
• Generalized forbidden subposet problems
• Tiling the Boolean lattice with copies of a poset

Cites work

• scientific article; zbMATH DE number 3845613 (Why is no real title available?)
• A Sperner theorem on unrelated chains of subsets
• A short proof of Sperner's lemma
• Diamond-free families
• Incomparable copies of a poset in the Boolean lattice.
• On diamond-free subposets of the Boolean lattice
• On generalized graphs

Cited in

(9)

• On Generalized Turán Results in Height Two Posets
• Packing the Boolean lattice with copies of a poset
• Minimum-sized generating sets of the direct powers of free distributive lattices
• Incomparable copies of a poset in the Boolean lattice.
• Families in posets minimizing the number of comparable pairs
• Supersaturation in posets and applications involving the container method
• Packing and covering k-chain free subsets in Boolean lattices
• Sperner theorems for unrelated copies of posets and generating distributive lattices
• Almost tiling of the Boolean lattice with copies of a poset

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q890020)