Sperner partition systems
From MaRDI portal
Abstract: A extsl{Sperner -partition system} on a set is a set of partitions of into classes such that the classes of the partitions form a Sperner set system (so no class from a partition is a subset of a class from another partition). These systems were defined by Meagher, Moura and Stevens in cite{MMS} who showed that if , then the largest Sperner -partition system has size . In this paper we find bounds on the size of the largest Sperner -partition system where does not divide the size of , specifically, we give an exact bound when and upper and lower bounds when , and .
Recommendations
Cites work
Cited in
(8)- On a combinatorial framework for fault characterization
- New bounds on the maximum size of Sperner partition systems
- A Sperner-type theorem for set-partition systems
- Disjoint spread systems and fault location
- All Maximum Size Two-Part Sperner Systems: In Short
- Detecting arrays for effects of single factors
- More constructions for Sperner partition systems
- Detecting arrays for effects of multiple interacting factors
This page was built for publication: Sperner partition systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2842260)