Article PDF
Avoid common mistakes on your manuscript.
References
Anderson, L: Intersection theorems and a lemma of Kleitman. Discrete Math. (To appear)
Daykin, D.E.: A lattice is distributive iff ¦A¦¦B¦≦¦A∨B¦¦A∧B¦. Nanta Math. (To appear)
Daykin, D.E.: Poset functions commuting with the product and yielding Čebyčev type inequalities. C.N.R.S. Colloque, Paris (1976) (To appear)
Daykin, D.E., Kleitman, D.J., West. D.B.: The number of meets between two subsets of a lattice. J. Combinatorial Theory [submitted]
Greene, C, Kleitman, D.J.: Proof techniques in the theory of finite sets. M.A.A. Studies in Combinatorics. Editor G.C. Rota (To appear)
Fortuin, C.M., Kasteleyn, P.W., Ginibre, J.: Correlation inequalities on some partially ordered sets. Comm. Math. Phys. 22 89–103 (1971)
Holley, R.: Remarks on the FKG inequalities. Comm. Math. Phys. 36, 227–231 (1974)
Kleitman, D.J.: Families of non-disjoint subsets. J. Combinatorial Theory 1, 153–155 (1966)
Seymour, P.D.: On incomparable collections of sets. Mathematika Period. Sb. Pererodov Inostran Statei. 20, 208–209 (1973)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ahlswede, R., Daykin, D.E. An inequality for the weights of two families of sets, their unions and intersections. Z. Wahrscheinlichkeitstheorie verw Gebiete 43, 183–185 (1978). https://doi.org/10.1007/BF00536201
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00536201