English
Related papers

Related papers: Bonnet-Myers sharp graphs of diameter three

200 papers

In this note we prove that any closed graph manifold admitting a metric of non-positive sectional curvature (NPC-metric) has a finite cover, which is fibered over the circle. An explicit criterion to have a finite cover, which is fibered…

Geometric Topology · Mathematics 2016-09-07 P. Svetlov

In this paper we show that a nonlocal minimal surface which is a graph outside a cylinder is in fact a graph in the whole of the space. As a consequence, in dimension~$3$, we show that the graph is smooth. The proofs rely on convolution…

Analysis of PDEs · Mathematics 2016-06-14 Serena Dipierro , Ovidiu Savin , Enrico Valdinoci

The first non-zero Laplacian eigenvalue $\lambda_1$ of a finite graph is bounded below by its minimum Lin--Lu--Yau curvature $\kappa$. This is a discrete analogue of the classical Lichnerowicz Theorem. A graph with $\lambda_1=\kappa$ is…

Combinatorics · Mathematics 2026-02-12 Kaizhe Chen , Shiping Liu , Heng Zhang

Let $M=G/K$ be a compact homogeneous space and assume that $G$ and $K$ have many simple factors. We show that the topological condition of having maximal third Betti number, in the sense that $b_3(M)=s-1$ if $G$ has $s$ simple factors, so…

Differential Geometry · Mathematics 2024-10-18 Jorge Lauret , Cynthia Will

A simplified version of the theory of strongly regular graphs is developed for the case in which the graphs have no triangles. This leads to (i) direct proofs of the Krein conditions, and (ii) the characterization of strongly regular graphs…

Combinatorics · Mathematics 2009-11-12 Norman Biggs

We show that a complete contractible 3-manifold with positive scalar curvature and bounded geometry must be $\mathbb R^3$. We also show that an open handlebody of genus larger than 1 does not admit complete metrics with positive scalar…

Differential Geometry · Mathematics 2025-02-17 Otis Chodosh , Yi Lai , Kai Xu

An oriented graph is a digraph that contains no 2-cycles, i.e., there is at most one arc between any two vertices. We show that every oriented graph $G$ of sufficiently large order $n$ with $\mathrm{deg}^+(x) +\mathrm{deg}^{-}(y)\geq…

Combinatorics · Mathematics 2025-07-08 Yulin Chang , Yangyang Cheng , Tianjiao Dai , Qiancheng Ouyang , Guanghui Wang

Given a triple covering $X$ of genus $g$ of a general (in the sense of Brill-Noether) curve $C$ of genus $h$, we show the existence of base-point-free pencils of degree $d$ which are not composed with the triple covering for any $d\ge…

alg-geom · Mathematics 2008-02-03 Takao Kato , Changho Keem , Akira Ohbuchi

We give a new upper bound for the average graph distance in terms of the average Ollivier curvature. Here, the average Ollivier curvature is weighted with the edge betweenness centrality. Moreover, we prove that equality is attained…

Combinatorics · Mathematics 2022-10-03 Florentin Münch

We classify the normal CR structures on $S^3$ and their automorphism groups. Together with [3], this closes the classification of normal CR structures on contact 3-manifolds. We give a criterion to compare 2 normal CR structures, and we…

Differential Geometry · Mathematics 2007-05-23 Florin Alexandru Belgun

Almost Moore mixed graphs\/} appear in the context of the degree/diameter problem as a class of extremal mixed graphs, in the sense that their order is one unit less than the Moore bound for such graphs. The problem of their existence has…

Combinatorics · Mathematics 2022-06-08 C. Dalfó , M. A. Fiol , N. López

In this paper, we consider the Ricci curvature of a directed graph, based on Lin-Lu-Yau's definition. We give some properties of the Ricci curvature, including conditions for a directed regular graph to be Ricci-flat. Moreover, we calculate…

Combinatorics · Mathematics 2018-08-24 Taiki Yamada

We classify all connected, simple, 3-regular graphs with girth at least 5 that are Ricci-flat. We use the definition of Ricci curvature on graphs given in Lin-Lu-Yau, Tohoku Math., 2011, which is a variation of Ollivier, J. Funct. Anal.,…

Combinatorics · Mathematics 2023-10-26 David Cushing , Riikka Kangaslampi , Yong Lin , Shiping Liu , Linyuan Lu , Shing-Tung Yau

A graph is 1-planar if it can be drawn in the plane so that each edge is crossed by at most one another edge. In this work we prove that each 1-planar graph of minimum degree at least $3$ contains an edge with degrees of its endvertices of…

Combinatorics · Mathematics 2019-12-17 Bei Niu , Xin Zhang

A graph is \textit{rigid} if it only admits the identity endomorphism. We show that for every $d\ge 3$ there exist infinitely many mutually rigid $d$-regular graphs of arbitrary odd girth $g\geq 7$. Moreover, we determine the minimum order…

Combinatorics · Mathematics 2025-02-18 Kolja Knauer , Gil Puig i Surroca

A centrality measure of the cut-edges of an undirected graph, given in [Altafini et al.~SIMAX 2023] and based on Kemeny's constant, is revisited. A numerically more stable expression is given to compute this measure, and an explicit…

Numerical Analysis · Mathematics 2025-03-05 Dario Bini , Steve Kirkland , Guy Latouche , Beatrice Meini

We classify $n$-dimensional geometric graph manifolds with nonnegative scalar curvature, and first show that if $n>3$, the universal cover splits off a codimension 3 Euclidean factor. We then proceed with the classification of the…

Differential Geometry · Mathematics 2021-09-17 Luis Florit , Wolfgang Ziller

By Hall's marriage theorem, we study lower bounds of the Lin-Lu-Yau curvature of amply regular graphs with girth $3$ or $4$ under different parameter restrictions. As a consequence, we show that each conference graph has positive Lin-Lu-Yau…

Combinatorics · Mathematics 2022-01-26 Xintian Li , Shiping Liu

We consider the degree-diameter problem for undirected and directed circulant graphs. To date, attempts to generate families of large circulant graphs of arbitrary degree for a given diameter have concentrated mainly on the diameter 2 case.…

Combinatorics · Mathematics 2017-03-13 David Bevan , Grahame Erskine , Robert Lewis

We show that if a planar graph $G$ with minimum degree at least $3$ has positive Lin-Lu-Yau Ricci curvature on every edge, then $\Delta(G)\leq 17$, which then implies that $G$ is finite. This is an analogue of a result of DeVos and Mohar…

Combinatorics · Mathematics 2020-10-09 Linyuan Lu , Zhiyu Wang
‹ Prev 1 3 4 5 6 7 10 Next ›