Abstract
The identity discovered in [1] can be viewed as a sharpening of the LYM inequality ([3], [4], [5]). It was extended in [2] so that it covers also Bollobás' inequality [6]. Here we present a further generalization and demonstrate that it shares with its predecessors the usefullness for uniqueness proofs in extremal set theory.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R. Ahlswede, andZ. Zhang: An identity in combinatorial extremal theory,Advances in Mathematics 80 (2) (1990), 137–151.
R. Ahlswede, andZ. Zhang: On cloud-antichains and related configurations,Discrete Mathematics 85 (1990), 225–245.
K. Yamamoto: Logarithmic order of free distributive lattices,J. Math. Soc. Japan 6 (1954), 343–353.
L.D. Meshalkin: A generalization of Sperner's theorem on the number of subsets of a finite set,Theor. Probability Appl. 8 (1963), 203–204.
D. Lubell: A short proof of Sperner's theorem,J. Combinatorial Theory 1 (1966), 299.
B. Bollobás: On generalized graphs,Acta Math. Acad. Sci. Hungar. 16 (1965), 447–452.
J.R. Griggs, J. Stahl, andW.T. Trotter: A Sperner theorem on unrelated chains of subsets,J. Comb. Theory, Ser. A 36 (1984), 124–127.
K. Engel, andH.D.O.F. Gronau:Sperner Theory in Partially Ordered Sets, Texte zur Mathematik Bd. 78, Teubner, Leipzig, 1985.
E. Sperner:Ein Satz über Untermengen einer endlichen Menge, Math. Z.27 (1928), 544–548.
J. Körner, andG. Simonyi: A Sperner-type theorem and qualitative independence,J. Comb. Theory, Ser. A 59 (1992), 90–103.