A tour of M-part L-Sperner families
Journal of Combinatorial Theory Series A
Mixed orthogonal arrays, k-dimensional m-part sperner multifamilies, and full multitransversals
Information Theory, Combinatorics, and Search Theory
| Hi-index | 0.00 |
This is a paper about the beauty of the permutation method. New and shorter proofs are given for the theorem [P. L. Erdos and G. O. H. Katona, J. Combin. Theory. Ser. A, 43 (1986), pp. 58--69; S. Shahriari, Discrete Math., 162 (1996), pp. 229--238] determining all extremal two-part Sperner families and for the uniqueness of k-Sperner families of maximum size [P. Erdos, Bull. Amer. Math. Soc., 51 (1945), pp. 898--902].