English
Related papers

Related papers: Sharp isoperimetric inequalities for infinite plan…

200 papers

We give variants of the Krein bound and the absolute bound for graphs with a spectrum similar to that of a strongly regular graph. In particular, we investigate what we call approximately strongly regular graphs. We apply our results to…

Combinatorics · Mathematics 2022-08-10 Ferdinand Ihringer

Let $F_l$ be the fan graph obtained by joining a vertex with a path on $l-1$ vertices. Yu, Li and Peng [Discrete Math. 346 (2023)] conjectured that if the number of edges of $G$ is $m$ and the spectral radius…

Combinatorics · Mathematics 2025-11-19 Loujun Yu , Yuejian Peng

In this paper we study the relationship of hyperbolicity and (Cheeger) isoperimetric inequality in the context of Riemannian manifolds and graphs. We characterize the hyperbolic manifolds and graphs (with bounded local geometry) verifying…

Metric Geometry · Mathematics 2016-05-17 Álvaro Martínez-Pérez , José M. Rodríguez

We prove that if $(X,\mathsf{d},\mathfrak{m})$ is a metric measure space with $\mathfrak{m}(X)=1$ having (in a synthetic sense) Ricci curvature bounded from below by $K>0$ and dimension bounded above by $N\in [1,\infty)$, then the classic…

Metric Geometry · Mathematics 2019-05-08 Fabio Cavalletti , Andrea Mondino

We prove that for supercritical percolation on every infinite transitive graph, the probability that the origin belongs to a finite cluster of size at least $n$ decays exponentially in $\Phi(n)$, where $\Phi$ is the isoperimetric function…

The inverse degree of a graph is the sum of the reciprocals of the degrees of its vertices. We prove that in any connected planar graph, the diameter is at most 5/2 times the inverse degree, and that this ratio is tight. To develop a…

Combinatorics · Mathematics 2010-06-15 Radoslav Fulek , Filip Morić , David Pritchard

Any infinite graph has site and bond percolation critical probabilities satisfying $p_c^{site}\geq p_c^{bond}$. The strict version of this inequality holds for many, but not all, infinite graphs. In this paper, the class of graphs for which…

Probability · Mathematics 2010-04-30 Massimo Franceschetti , Mathew D. Penrose , Tom Rosoman

Let $Z$ be the typical cell of a stationary Poisson hyperplane tessellation in $\mathbb{R}^d$. The distribution of the number of facets $f(Z)$ of the typical cell is investigated. It is shown, that under a well-spread condition on the…

Probability · Mathematics 2016-08-30 Gilles Bonnet , Pierre Calka , Matthias Reitzner

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…

Combinatorics · Mathematics 2014-10-28 Tali Kaufman , David Kazhdan , Alexander Lubotzky

In this paper, we obtain the isoperimetric inequality on conformally flat manifold with finite total $Q$-curvature. This is a higher dimensional analogue of Li and Tam's result \cite{L-T} on surfaces with finite total Gaussian curvature.…

Differential Geometry · Mathematics 2010-04-05 Yi Wang

A graph whose vertices are points in the plane and whose edges are noncrossing straight-line segments of unit length is called a \emph{matchstick graph}. We prove two somewhat counterintuitive results concerning the maximum number of edges…

Combinatorics · Mathematics 2025-06-03 Panna Gehér , János Pach , Konrad Swanepoel , Géza Tóth

This paper investigates quasi-isometries between graphs with variable edge lengths. A quasi-isometry is a mapping between metric spaces that approximately preserves distances, allowing for a bounded amount of additive and multiplicative…

Combinatorics · Mathematics 2025-03-11 James Davies , Meike Hatzel , Robert Hickingbotham

We introduce a curvature function for planar graphs to study the connection between the curvature and the geometric and spectral properties of the graph. We show that non-positive curvature implies that the graph is infinite and locally…

Combinatorics · Mathematics 2011-01-18 Matthias Keller

Szemer\'edi's regularity lemma is a powerful tool in graph theory. It states that for every large enough graph, there exists a partition of the edge set with bounded size such that most induced subgraphs are quasirandom. When the graph is a…

Combinatorics · Mathematics 2022-09-20 Alexis Chevalier , Elad Levi

We introduce a new infinite family of regular graphs admitting nested solutions in the edge-isoperimetric problem for all their Cartesian powers. The obtained results include as special cases most of previously known results in this area.

Combinatorics · Mathematics 2023-07-12 Sergei L. Bezrukov , Pavle Bulatovic , Nikola Kuzmanovski

The complexity of the graph isomorphism problem for trapezoid graphs has been open over a decade. This paper shows that the problem is GI-complete. More precisely, we show that the graph isomorphism problem is GI-complete for comparability…

Discrete Mathematics · Computer Science 2016-01-20 Asahi Takaoka

We prove that for any weakly convergent sequence of finite graphs with bounded vertex degrees, there exists a topological limit graphing.

Combinatorics · Mathematics 2007-05-23 Gabor Elek

Fix integers $r\geq 4$ and $i\geq 2$ (for $r=4$ assume $i\geq 3$). Assuming that the rational number $s$ defined by the equation $\binom{i+1}{2}s+(i+1)=\binom{r+i}{i}$ is an integer, we prove an upper bound for the genus of a reduced and…

Algebraic Geometry · Mathematics 2022-08-02 Vincenzo Di Gennaro

It is shown that every even, zonal measure on the Euclidean unit sphere gives rise to an isoperimetric inequality for sets of finite perimeter which directly implies the classical Euclidean isoperimetric inequality. The strongest member of…

Metric Geometry · Mathematics 2018-05-01 Christoph Haberl , Franz E. Schuster

Given a planar graph $G$, we consider drawings of $G$ in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an injective embedding $\pi$ of the vertex set of $G$ into…

Discrete Mathematics · Computer Science 2011-05-20 Mihyun Kang , Oleg Pikhurko , Alexander Ravsky , Mathias Schacht , Oleg Verbitsky
‹ Prev 1 4 5 6 7 8 10 Next ›