119 citations · 207 across the 49 of their papers we have counts for
Showing 2001Show all
3 papers · 1 filter
math.CO2001
A unifying generalization of Sperner's theorem
Matthias Beck, Xueqin Wang, Thomas Zaslavsky
Sperner's bound on the size of an antichain in the lattice P(S) of subsets of a finite set S has been generalized in three different directions: by Erdos to subsets of P(S) in whic…
math.CO2001★ 2 cited
A Meshalkin theorem for projective geometries
Matthias Beck, Thomas Zaslavsky
Let M be a family of sequences (a_1,...,a_p) where each a_k is a flat in a projective geometry of rank n (dimension n-1) and order q, and the sum of ranks, r(a_1) + ... + r(a_p), e…
math.CO2001
A shorter, simpler, stronger proof of the Meshalkin-Hochberg-Hirsch bounds on componentwise antichains
Matthias Beck, Thomas Zaslavsky
Meshalkin's theorem states that a class of ordered p-partitions of an n-set has at most members if for each k the k'th parts form an antichain. We giv…