Let k ≥ 1. A Sperner k-family is a maximum-sized subset of a finite poset that contains no chain with k + 1 elements. In 1976 Greene and Kleitman defined a lattice-ordering on the set Sk(P) of Sperner k-families of a fifinite poset P and posed the problem: “Characterize and interpret the join- and meet-irreducible elements of Sk(P),” adding, “This has apparently not been done even for the case k = 1.”
In this article, the case k = 1 is done.
Davey, B. A. and Priestley, H. A. Introduction to Lattices and Order. Cambridge University Press, Cambridge, 2002. Second edition.
Dilworth, R. P. A decomposition theorem for partially ordered sets. Annals of Mathematics 51 (1950), 161–166.
Dilworth, R. P. Some combinatorial problems on partially ordered sets. In Proceedings of Symposia in Applied Mathematics (Providence, Rhode Island, 1960), vol. 10., American Mathematical Society, pages. 85–90.
Freese, R. An application of Dilworth’s lattice of maximal antichains. Discrete Mathematics 7 (1974), 107–109.
Freese, R., Jezcaronek, J. and Nation, J. B. Free Lattices. American Mathematical Society, Providence, Rhode Island, 1995.
Greene, C. and Kleitman, D. J. The structure of Sperner k-families. Journal of Combinatorial Theory (A) 20 (1976), 41–68.
Hall, P. On representatives of subsets. Journal of the London Mathematical Society 10 (1935), 26–30.
Koh, K. M. On the lattice of maximum-sized antichains of a finite poset. Algebra Universalis, 17 (1983), 73–86.
Wikipedia. Strongly connected component. (December 26, 2015). Retrieved from https://en.wikipedia.org/wiki/Strongly_connected_component.