A Sperner-type theorem for set-partition systems
From MaRDI portal
Publication:2571313
Let \(A\) be a set, \(| A| =n=ck.\) Further, let \(S\) be a system of partitions of \(A\) so that each partition in \(S\) consists of \(k\) classes, and if \(P_{1},P_{2}\) are two partitions in \(S\) with \(c_{1}\in P_{1},c_{2}\in P_{2},\) then \(c_{1}\) and \(c_{2}\) are incomparable sets. It is proved in the paper that \(S\) contains at most \(\binom{ck-1}{c-1}\) partitions.
Recommendations
Cited in
(13)- Sperner systems containing at most \(k\) sets of every cardinality
- On a combinatorial framework for fault characterization
- An EKR-theorem for finite buildings of type \(D_{\ell }\)
- New bounds on the maximum size of Sperner partition systems
- Disjoint spread systems and fault location
- Sperner partition systems
- scientific article; zbMATH DE number 4089619 (Why is no real title available?)
- scientific article; zbMATH DE number 3993588 (Why is no real title available?)
- Detecting arrays for effects of single factors
- More constructions for Sperner partition systems
- Detecting arrays for effects of multiple interacting factors
- Bipartite sets of spheres and Casey-type theorems
- Lower bounds and construction of detecting arrays
This page was built for publication: A Sperner-type theorem for set-partition systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2571313)
