The convex hull of antichains in posets (Q1204518): Difference between revisions

This paper studies the convex hull of antichains of arbitrary finite posets, following the new research direction of extremal set theory initiated by the reviewer, the author and \textit{G. O. H. Katona} [Combinatorica 4, 21-34 (1984; Zbl 0544.05001)]. Theorem 1 is a direct generalization of the well-known Kleitman-Edelberg-Lubell theorem about maximal size antichains in posets [\textit{D. Kleitman}, \textit{M. Edelberg} and \textit{D. Lubell}, Discrete Math. 1, 47-53 (1971; Zbl 0217.027)]. The proof is a nice application of \textit{L. Lovász}'s perfect hypergraph theory [Discrete Math. 2, 253-267 (1972; Zbl 0239.05111)]. The other main result is the finite vector space analogue of \textit{K.-W. Lih}'s theorem about such maximal antichains, whose elements all meet a prescribed fixed subset of the underlying set [J. Comb. Theory, Ser. A 29, 182-185 (1980; Zbl 0446.05002)].