New bounds on the maximum size of Sperner partition systems. (December 2020)

• Record Type: Journal Article
• Authors: Chang, Yanxun; Colbourn, Charles J.; Gowty, Adam; Horsley, Daniel; Zhou, Junling
• Is Part Of: European journal of combinatorics. Volume 90(2020)
• Publication Date: 2020-12
• Subjects: Combinatorial analysis -- Periodicals; Analyse combinatoire -- Périodiques; Combinatorial analysis; Periodicals; Electronic journals; 511.6
• DOI: 10.1016/j.ejc.2020.103165
• Languages: English
• ISSNs: 0195-6698

Abstract

Abstract: An ( n, k ) - Sperner partition system is a collection of partitions of some n -set, each into k nonempty classes, such that no class of any partition is a subset of a class of any other. The maximum number of partitions in an ( n, k ) -Sperner partition system is denoted SP ( n, k ) . In this paper we introduce a new construction for Sperner partition systems and use it to asymptotically determine SP ( n, k ) in many cases as n k becomes large. We also give a slightly improved upper bound for SP ( n, k ) and exhibit an infinite family of parameter sets ( n, k ) for which this bound is tight.