Related papers: Isoperimetry in product graphs

We give a polynomial-time algorithm for computing upper bounds on some of the smaller energy eigenvalues in a spin-1/2 ferromagnetic Heisenberg model with any graph $G$ for the underlying interactions. An important ingredient is the…

Motivated by random walks on subsets of the hypercube, we prove two discrete functional inequalities on the hypercube. First, we give a short, elementary proof of the Poincar\'e inequality on increasing subsets of the cube recently…

In this paper, we prove a class of weighted isoperimetric inequalities for bounded domains in hyperbolic space by using the isoperimetric inequality with log-convex density in Euclidean space. As a consequence, we remove the horo-convex…

A celebrated theorem of Kanai states that quasi-isometries preserve isoperimetric inequalities between uniform Riemannian manifolds (with positive injectivity radius) and graphs. Our main result states that we can study the (Cheeger)…

This paper considers an edge minimization problem in saturated bipartite graphs. An $n$ by $n$ bipartite graph $G$ is $H$-saturated if $G$ does not contain a subgraph isomorphic to $H$ but adding any missing edge to $G$ creates a copy of…

Let $G=(V,E)$ be a simple graph. The concept of Inverse symmetric division deg index $(ISDD)$ was introduced in the chemical graph theory very recently. In spite of this, a few papers have already appeared with this index in the literature.…

Given a graph $H$ and a natural number $n$, the extremal number $\mathrm{ex}(n, H)$ is the largest number of edges in an $n$-vertex graph containing no copy of $H$. In this paper, we obtain a general upper bound for the extremal number of…

In 1964, Erd\H{o}s proposed the problem of estimating the Tur\'an number of the $d$-dimensional hypercube $Q_d$. Since $Q_d$ is a bipartite graph with maximum degree $d$, it follows from results of F\"uredi and Alon, Krivelevich, Sudakov…

Our basic result, an isoperimetric inequality for Hamming cube $Q_n$, can be written: \[ \int h_A^\beta d\mu \ge 2 \mu(A)(1-\mu(A)). \] Here $\mu$ is uniform measure on $V=\{0,1\}^n$ ($=V(Q_n)$); $\beta=\log_2(3/2)$; and, for $S\subseteq V$…

We prove the sharp quantitative stability for a wide class of weighted isoperimetric inequalities. More precisely, we consider isoperimetric inequalities in convex cones with homogeneous weights. Inspired by the proof of such isoperimetric…

We prove an isoperimetric inequality for the uniform measure on a uniformly convex body and for a class of uniformly log-concave measures (that we introduce). These inequalities imply (up to universal constants) the log-Sobolev inequalities…

Expander graphs have been intensively studied in the last four decades. In recent years a high dimensional theory of expanders has emerged, and several variants have been studied. Among them stand out coboundary expansion and topological…

We obtain a generalized version of an inequality, first derived by C. Bandle in the analytic setting, for weak subsolutions of a singular Liouville-type equation. As an application we obtain a new proof of the Alexandrov isoperimetric…

Settling Kahn's conjecture (2001), we prove the following upper bound on the number $i(G)$ of independent sets in a graph $G$ without isolated vertices: \[ i(G) \le \prod_{uv \in E(G)} i(K_{d_u,d_v})^{1/(d_u d_v)}, \] where $d_u$ is the…

The hypergraph Moore bound is an elegant statement that characterizes the extremal trade-off between the girth - the number of hyperedges in the smallest cycle or even cover (a subhypergraph with all degrees even) and size - the number of…

Let $i_t(G)$ be the number of independent sets of size $t$ in a graph $G$. Alavi, Erd\H{o}s, Malde and Schwenk made the conjecture that if $G$ is a tree then the independent set sequence $\{i_t(G)\}_{t\geq 0}$ of $G$ is unimodal; Levit and…

A graph is called $\alpha_i$-metric ($i \in {\cal N}$) if it satisfies the following $\alpha_i$-metric property for every vertices $u, w, v$ and $x$: if a shortest path between $u$ and $w$ and a shortest path between $x$ and $v$ share a…

We obtain new sharp isoperimetric inequalities on a Riemannian manifold equipped with a probability measure, whose generalized Ricci curvature is bounded from below (possibly negatively), and generalized dimension and diameter of the convex…

In this paper we consider a partial overdetermined mixed boundary value problem in domains inside a cone as in [18]. We show that in cones having an isoperimetric property the only domains which admit a solution and which minimize a…

The edge-bandwidth of a graph is the minimum, over all labelings of the edges with distinct integers, of the maximum difference between labels of two incident edges. We prove that edge-bandwidth is at least as large as bandwidth for every…