AbstractIt is well known that there is a simple equivalence between isoperimetric inequalities and certain analytic inequalities in Riemannian manifolds (see Rothaus, J. Funct. Anal. 64 (1985) 296–313). We generalize these results to graphs, and use them to derive isoperimetric inequalities for product graphs
In this paper, we study the relationship of hyperbolicity and (Cheeger) isoperimetric inequality in ...
AbstractWe consider an edge-isoperimetric problem (EIP) on the cartesian powers of graphs. One of ou...
Abstract. The edge isoperimetric inequality in the discrete cube specifies, for each pair of integers...
AbstractIt is well known that there is a simple equivalence between isoperimetric inequalities and c...
We survey results on edge isoperimetric problems on graphs, present some new results and show some a...
For a general family of graphs on Zn, we translate the edge-isoperimetric problem into a continuous ...
AbstractIn combinatorics we often meet two kinds of extremal problems. In one kind, optimal configur...
We study in this paper the relationship of isoperimetric inequality and hyperbolicity for graphs an...
AbstractVarious inequalities involving the isoperimetric number and the spectrum of graphs are given...
The Isoperimetric Inequality has many different proofs using methods from diverse mathematical field...
AbstractThere is a simple equivalence between isoperimetric inequalities in Riemannian manifolds and...
AbstractThe main aim of this paper is to prove that, for a connected graph G, the sequence (Gn)1∞ of...
We survey results on edge isoperimetric problems on graphs, present some new results and show some a...
In this paper, we study the relationship of hyperbolicity and (Cheeger) isoperimetric inequality in ...
AbstractWe introduce a new graph for all whose cartesian powers the vertex isoperimetric problem has...
In this paper, we study the relationship of hyperbolicity and (Cheeger) isoperimetric inequality in ...
AbstractWe consider an edge-isoperimetric problem (EIP) on the cartesian powers of graphs. One of ou...
Abstract. The edge isoperimetric inequality in the discrete cube specifies, for each pair of integers...
AbstractIt is well known that there is a simple equivalence between isoperimetric inequalities and c...
We survey results on edge isoperimetric problems on graphs, present some new results and show some a...
For a general family of graphs on Zn, we translate the edge-isoperimetric problem into a continuous ...
AbstractIn combinatorics we often meet two kinds of extremal problems. In one kind, optimal configur...
We study in this paper the relationship of isoperimetric inequality and hyperbolicity for graphs an...
AbstractVarious inequalities involving the isoperimetric number and the spectrum of graphs are given...
The Isoperimetric Inequality has many different proofs using methods from diverse mathematical field...
AbstractThere is a simple equivalence between isoperimetric inequalities in Riemannian manifolds and...
AbstractThe main aim of this paper is to prove that, for a connected graph G, the sequence (Gn)1∞ of...
We survey results on edge isoperimetric problems on graphs, present some new results and show some a...
In this paper, we study the relationship of hyperbolicity and (Cheeger) isoperimetric inequality in ...
AbstractWe introduce a new graph for all whose cartesian powers the vertex isoperimetric problem has...
In this paper, we study the relationship of hyperbolicity and (Cheeger) isoperimetric inequality in ...
AbstractWe consider an edge-isoperimetric problem (EIP) on the cartesian powers of graphs. One of ou...
Abstract. The edge isoperimetric inequality in the discrete cube specifies, for each pair of integers...
DOI