Related papers: An approximate isoperimetric inequality for r-sets

We prove a stability version of Harper's cube vertex isoperimetric inequality, showing that subsets of the cube with vertex boundary close to the minimum possible are close to (generalised) Hamming balls. Furthermore, we obtain a local…

In this paper, we deals with isoperimetric-type inequalities for closed convex curves in the Euclidean plane R^2. We derive a family of parametric inequalities involving the following geometric functionals associated to a given convex curve…

We provide a sharp lower bound for the perimeter of the inner parallel sets of a convex body $\Omega$. The bound depends only on the perimeter and inradius $r$ of the original body and states that \[|\partial\Omega_t| \geq…

It is well known that isoperimetric inequalities imply in a very general measure-metric-space setting appropriate concentration inequalities. The former bound the boundary measure of sets as a function of their measure, whereas the latter…

We prove, using elementary methods of complex analysis, the following generalization of the isoperimetric inequality: if $p\in\re$, $\Omega\subset\re^2$ then the inequality $$…

Let G = (V,E) be a finite, simple and undirected graph. For $S \subseteq V$, let $\delta(S,G) = \{(u,v) \in E : u \in S \mbox {and} v \in V-S \}$ be the edge boundary of $S$. Given an integer $i$, $1 \leq i \leq | V |$, let the edge…

The discrete isoperimetric inequality states that among all n -gons with a fixed area, the regular n -gon has the least perimeter. We prove analogues of the discrete isoperimetric inequality (involving circumradius or inradius) for cyclic…

Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$. A subset $I$ of $V(G)$ is an independent vertex subset if no two vertices in $I$ are adjacent in $G$. We study the number, $\sigma_1(G)$, of all subsets of $v(G)$ that contain…

In this paper, we study a reverse isoperimetric inequality for planar convex bodies whose radius of curvature is between two positive numbers 0 < $\alpha$ < $\beta$, called ($\alpha$, $\beta$)--convex bodies. We show that among planar…

The $k$-th symmetric product of a graph $G$ with vertex set $V$ with edge set $E$ is a graph with vertices as $k$-sets of $V$, where two $k$-sets are connected by an edge if and only if their symmetric difference is an edge in $E$. Using…

In this paper, we prove some isoperimetric inequalities and give a sharp bound for the positive solution of sublinear elliptic equations.

Let $G = (V,E)$ denote a simple graph with the vertex set $V$ and the edge set $E$. The profile of a vertex set $V'\subseteq V$ denotes the multiset of pairwise distances between the vertices of $V'$. Two disjoint subsets of $V$ are…

We consider asymptotically flat Riemannian manifolds with nonnegative scalar curvature that are conformal to $\R^{n}\setminus \Omega, n\ge 3$, and so that their boundary is a minimal hypersurface. (Here, $\Omega\subset \R^{n}$ is open…

In this paper we study the quantitative isoperimetric inequality in the plane. We prove the existence of a set $\Omega$, different from a ball, which minimizes the ratio $\delta(\Omega)/\lambda^2(\Omega)$, where $\delta$ is the…

We consider the family of graphs whose vertex set is $\mathbb{Z}^n$ where two vertices are connected by an edge when their $\ell_\infty$-distance is 1. Towards an edge isoperimetric inequality for this graph, we calculate the edge boundary…

We provide sharp bounds for the isoperimetric constants of infinite plane graphs (tessellations) with bounded vertex and face degrees. For example, if $G$ is a plane graph satisfying the inequalities $p_1 \leq \mbox{deg}\ v \leq p_2$ for $v…

Our main theoretical result is that, if a simple polytope has a pair of complementary vertices (i.e., two vertices with no facets in common), then it has at least two such pairs, which can be chosen to be disjoint. Using this result, we…

Let $ M^n$ be a closed immersed minimal hypersurface in the unit sphere $\mathbb{S}^{n+1}$. We establish a special isoperimetric inequality of $M^n$. As an application, if the scalar curvature of $ M^n$ is constant, then we get a uniform…

This paper considers affine analogues of the isoperimetric inequality in the sense of piecewise linear topology. Given a closed polygon P embedded in R^d having n edges, we give upper and lower bounds for the minimal number of triangles…

We show that intersection graphs of compact convex sets in R^n of bounded aspect ratio have asymptotic dimension at most 2n+1. More generally, we show this is the case for intersection graphs of systems of subsets of any metric space of…