[1] |
Anderson, L: Intersection theorems and a lemma of Kleitman. Discrete Math. (To appear) · Zbl 0349.05006 |
[2] |
Daykin, D.E.: A lattice is distributive iff ¦A¦¦B¦≦¦A∨B¦¦A∧B¦. Nanta Math. (To appear) |
[3] |
Daykin, D. E., Poset functions commuting with the product and yielding Čebyčev type inequalities (1976), Paris: C.N.R.S. Colloque, Paris |
[4] |
Daykin, D.E., Kleitman, D.J., West. D.B.: The number of meets between two subsets of a lattice. J. Combinatorial Theory [submitted] · Zbl 0421.06004 |
[5] |
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) · Zbl 0409.05012 |
[6] |
Fortuin, C. M.; Kasteleyn, P. W.; Ginibre, J., Correlation inequalities on some partially ordered sets, Comm. Math. Phys., 22, 89-103 (1971) · Zbl 0346.06011 |
[7] |
Holley, R., Remarks on the FKG inequalities, Comm. Math. Phys., 36, 227-231 (1974) |
[8] |
Kleitman, D. J., Families of non-disjoint subsets, J. Combinatorial Theory, 1, 153-155 (1966) · Zbl 0141.00801 |
[9] |
Seymour, P. D., On incomparable collections of sets, Mathematika Period. Sb. Pererodov Inostran Statei., 20, 208-209 (1973) · Zbl 0288.05002 |