Edge-isoperimetric inequalities in the grid

Bernstein, A. J.: Maximally connected arrays on then-cube,SIAM J. Appl. Math. 15 (1967), 1485?1489.

Bollobás, B.:Combinatorics, Cambridge University Press, 1986, xii+177 pp.

Bollobás, B., andLeader, I.: Compressions and isoperimetric inequalities,J. Combinatorial Theory (A),56 (1991), 47?62.

Clements, G. F.: Sets of lattice points which contain a maximal number of edges,Proc. Amer. Math. Soc. 27 (1971), 13?15.

Frankl, P. The shifting technique in extremal set theory, inSurveys in Combinatorics 1987 (Whitehead, C., ed.), London Math. Soc. Lecture Note Series 123, Cambridge University Press, 1987, pp. 81?110.

Harper, L. H.: Optimal assignments of numbers to vertices,SIAM J. Appl. Math. 12 (1964), 131?135.

Hart, S. A note on the edges of then-cube,Discrete Math. 14 (1976), 157?163.

Kleitman, D. J., Krieger, M. M., andRothschild, B. L.: Configurations maximizing the number of pairs of Hamming-adjacent lattice points.Studies in Appl. Math. 50 (1971), 115?119.

Lindsey, J. H.: Assignment of numbers to vertices,Amer. Math. Monthly 71 (1964), 508?516.

Wang, D.-L., andWang, P.: Discrete isoperimetric problems,SIAM J. Appl. Math 32 (1977), 860?870.