Sperner partition systems

From MaRDI portal



Abstract: A extsl{Sperner k-partition system} on a set X is a set of partitions of X into k 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 |X|=kell, then the largest Sperner k-partition system has size . In this paper we find bounds on the size of the largest Sperner k-partition system where k does not divide the size of X, specifically, we give an exact bound when k=2 and upper and lower bounds when |X|=2k+1, |X|=2k+2 and |X|=3k1.











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)