1. Katona, G., A Theorem of Finite Sets, Theory of Graphs (Proc. Colloq. on Graph Theory, Tihany, Hungary, 1966), Erdős, P. and Katona, G., Eds., New York: Academic, 1968, pp. 187–207.
2. Kruskal, J.B., The Number of Simplices in a Complex, Mathematical Optimization Techniques (Proc. Sympos. on Mathematical Optimization Techniques, Santa Monica, CA, 1960), Bellman, R., Ed., Berkeley: Univ. of California Press, 1963, pp. 251–278.
3. Lindström, B.A. and Zetterström, H.O., A Combinatorial Problem in the k-adic Number Systems, Proc. Amer. Math. Soc., 1967, vol. 18, no. 1, pp. 166–170.
4. Schützenberger, M.P., A Characteristic Property of Certain Polynomials of E.F. Moore and C.E. Shannon, RLE Quarterly Progress Report no. 55, MIT Research Laboratory of Electronics, 1959, pp. 117–118.
5. Ahlswede, R. and Cai, N., Shadows and Isoperimetry under the Sequence-Subsequence Relation, Combinatorica, 1997, vol. 17, no. 1, pp. 11–29.