We consider a variant of what is known as the discrete isoperimetric problem, namely the problem of minimising the size of the boundary of a family of subsets of a finite set. We use the technique of $\lq$shifting' to provide an alternative proof of a result of Hart. This technique was introduced in the early 1980s by Frankl and F\"{u}redi and gave alternative proofs of previously known classical results like the discrete isoperimetric problem itself and the Kruskal-Katona theorem. Hence our purpose is to bring Hart's result into this general framework
Abstract. The edge isoperimetric inequality in the discrete cube specifies, for each pair of integers...
The celebrated isoperimetric theorem says that the circle provides the least-perimeter way to enclos...
AbstractWe introduce some equivalence relations on graphs and posets and prove that they are closed ...
We consider a variant of what is known as the discrete isoperimetric problem, namely the problem of ...
AbstractKleitman and West pointed out that a discrete isoperimetric problem closely related to Krusk...
AbstractKleitman and West pointed out that a discrete isoperimetric problem closely related to Krusk...
As it is well-known, the classical isoperimetric problem on the plane claims to find a simple closur...
This paper is a survey on discrete isoperimetric type problems. We present here as some known facts ...
For a general family of graphs on Zn, we translate the edge-isoperimetric problem into a continuous ...
This article is a study of the solution set of a discrete isoperimetric problem. 1 Introduction and ...
We establish a structure theorem for minimizing sequences for the isoperimetric problem on noncompac...
Dedicated to Gerry Ladas in appreciation of his contributions to the subject area of difference equa...
We present here a description of all solutions of the isoperimetric problem in Hamming space of some...
We introduce some equivalence relations on graphs and posets and prove that they are closed under th...
AbstractWe solve the isoperimetric problem for subsets in the set χ∗ of binary sequences of finite l...
Abstract. The edge isoperimetric inequality in the discrete cube specifies, for each pair of integers...
The celebrated isoperimetric theorem says that the circle provides the least-perimeter way to enclos...
AbstractWe introduce some equivalence relations on graphs and posets and prove that they are closed ...
We consider a variant of what is known as the discrete isoperimetric problem, namely the problem of ...
AbstractKleitman and West pointed out that a discrete isoperimetric problem closely related to Krusk...
AbstractKleitman and West pointed out that a discrete isoperimetric problem closely related to Krusk...
As it is well-known, the classical isoperimetric problem on the plane claims to find a simple closur...
This paper is a survey on discrete isoperimetric type problems. We present here as some known facts ...
For a general family of graphs on Zn, we translate the edge-isoperimetric problem into a continuous ...
This article is a study of the solution set of a discrete isoperimetric problem. 1 Introduction and ...
We establish a structure theorem for minimizing sequences for the isoperimetric problem on noncompac...
Dedicated to Gerry Ladas in appreciation of his contributions to the subject area of difference equa...
We present here a description of all solutions of the isoperimetric problem in Hamming space of some...
We introduce some equivalence relations on graphs and posets and prove that they are closed under th...
AbstractWe solve the isoperimetric problem for subsets in the set χ∗ of binary sequences of finite l...
Abstract. The edge isoperimetric inequality in the discrete cube specifies, for each pair of integers...
The celebrated isoperimetric theorem says that the circle provides the least-perimeter way to enclos...
AbstractWe introduce some equivalence relations on graphs and posets and prove that they are closed ...