PUB - Publikationen an der Universität Bielefeld

We consider subsets of the n-dimensional grid with the Manhattan metrics, tile., the Cartesian product of chains of lengths k(1),..., k(n)) and study those of them which have maximal number of induced edges of the grid, and those which are separable from their complement by the least number of edges. The first problem was considered for k(1) = ... = k(n) by Bollobas and Leader [1]. Here we extend their result to arbitrary k(1),..., k(n), and give also a simpler proof based on a new approach. For the second problem, [1] offers only an inequality. We show that bur approach to the first problem also gives a solution for the second problem, if all k(i) = infinity. If all k(i)'s are finite, we present an exact solution for n = 2.