English
Related papers

Related papers: Bonnet-Myers sharp graphs of diameter three

200 papers

We prove distance bounds for graphs possessing positive Bakry-\'Emery curvature apart from an exceptional set, where the curvature is allowed to be non-positive. If the set of non-positively curved vertices is finite, then the graph admits…

Differential Geometry · Mathematics 2019-03-26 Shiping Liu , Florentin Münch , Norbert Peyerimhoff , Christian Rose

In this paper, we compare Ollivier Ricci curvature and Bakry-\'Emery curvature notions on combinatorial graphs and discuss connections to various types of Ricci flatness. We show that non-negativity of Ollivier Ricci curvature implies…

Combinatorics · Mathematics 2023-10-26 David Cushing , Supanat Kamtue , Riikka Kangaslampi , Shiping Liu , Norbert Peyerimhoff

We prove that for every integer $d \ge 3$, the median eigenvalues of any graph of maximum degree $d$ are bounded above by $\sqrt{d-1}$. We also prove that, in three separate cases, the median eigenvalues of a graph of maximum degree $d$ are…

Combinatorics · Mathematics 2026-03-31 Hricha Acharya , Zilin Jiang , Shengtong Zhang

A Graph is called 2-self-centered if its diameter and radius both equal to 2. In this paper, we begin characterizing these graphs by characterizing edge-maximal 2-self-centered graphs via their complements. Then we split characterizing…

Combinatorics · Mathematics 2019-10-29 Mohammad Hadi Shekarriz , Madjid Mirzavaziri , Kamyar Mirzavaziri

It is well known that 3--regular graphs with arbitrarily large girth exist. Three constructions are given that use the former to produce non-Hamiltonian 3--regular graphs without reducing the girth, thereby proving that such graphs with…

Combinatorics · Mathematics 2019-02-28 Michael Haythorpe

Deciding whether a planar graph (even of maximum degree $4$) is $3$-colorable is NP-complete. Determining subclasses of planar graphs being $3$-colorable has a long history, but since Gr\"{o}tzsch's result that triangle-free planar graphs…

Combinatorics · Mathematics 2020-05-15 François Dross , Borut Lužar , Mária Maceková , Roman Soták

We show that the size of a 4-critical graph of girth at least five is bounded by a linear function of its genus. This strengthens the previous bound on the size of such graphs given by Thomassen. It also serves as the basic case for the…

Combinatorics · Mathematics 2019-04-17 Zdeněk Dvořák , Daniel Kráľ , Robin Thomas

Amply regular graphs are graphs with local distance-regularity constraints. In this paper, we prove a weaker version of a conjecture proposed by Qiao, Park, and Koolen on diameter bounds of amply regular graphs and make new progress on…

Differential Geometry · Mathematics 2025-07-08 Kaizhe Chen , Chunyang Hu , Shiping Liu , Heng Zhang

A rank 3 graph is an orbital graph of a rank 3 permutation group of even order. Despite the classification of rank 3 graphs being complete, see, e.g., Chapter 11 of the recent monograph 'Strongly regular graphs' by Brouwer and Van…

Combinatorics · Mathematics 2024-06-10 Jin Guo , Andrey V. Vasil'ev , Rui Wang

We derive explicit formulas for the Lin-Lu-Yau curvature and the Ollivier-Ricci curvature in terms of graph parameters and an optimal assignment. Utilizing these precise expressions, we examine the relationship between the Lin-Lu-Yau…

Combinatorics · Mathematics 2024-12-06 Moritz Hehl

We say that a signed graph is $k$-critical if it is not $k$-colorable but every one of its proper subgraphs is $k$-colorable. Using the definition of colorability due to Naserasr, Wang, and Zhu that extends the notion of circular…

Combinatorics · Mathematics 2023-09-11 Laurent Beaudou , Penny Haxell , Kathryn Nurse , Sagnik Sen , Zhouningxin Wang

In this article we derive an explicit diameter bound for graphs satisfying the so-called curvature dimension conditions $CD(K,n)$. This refines a recent result due to Liu, M\"unch and Peyerimhoff when the dimension $n$ is finite.

Combinatorics · Mathematics 2024-05-21 Yi C. Huang , Ze Yang

Sturmfels-Sullivant conjectured that the cut polytope of a graph is normal if and only if the graph has no K_5 minor. In the present paper, it is proved that the normality of cut polytopes of graphs is a minor closed property. By using this…

Combinatorics · Mathematics 2019-01-11 Hidefumi Ohsugi

A fundamental theorem in the study of Dunwoody manifolds is a classification of finite graphs on $2n$ vertices that satisfy seven conditions (concerning planarity, regularity, and a cyclic automorphism of order $n$). Its significance is…

Geometric Topology · Mathematics 2020-08-06 James Howie , Gerald Williams

We give rigidity results for the discrete Bonnet-Myers diameter bound and the Lichnerowicz eigenvalue estimate. Both inequalities are sharp if and only if the underlying graph is a hypercube. The proofs use well-known semigroup methods as…

Differential Geometry · Mathematics 2017-05-22 Shiping Liu , Florentin Münch , Norbert Peyerimhoff

We prove a Bonnet-Myers type theorem for quaternionic contact manifolds of dimension bigger than 7. If the manifold is complete with respect to the natural sub-Riemannian distance and satisfies a natural Ricci-type bound expressed in terms…

Differential Geometry · Mathematics 2018-12-11 Davide Barilari , Stefan Ivanov

In this paper, we introduce a unified framework for defining Lin-Lu-Yau (LLY) Ricci curvature on both undirected and directed hypergraphs. By establishing upper bounds and monotonicity properties for the parameterized curvature…

Differential Geometry · Mathematics 2025-07-08 Yulu Tian , Liang Zhao

In this note, we prove that positive scalar curvature can pass to three dimensional Ricci limit spaces of non-negative Ricci curvature when it splits off a line. As a corollary, we obtain an optimal Bonnet-Myers type upper bound. Moreover,…

Differential Geometry · Mathematics 2023-03-28 Bo Zhu , Xingyu Zhu

We study graphs with nonnegative Bakry-\'Emery curvature or Ollivier curvature outside a finite subset. For such a graph, via introducing the discrete Gromov-Hausdorff convergence we prove that the space of bounded harmonic functions is…

Differential Geometry · Mathematics 2022-10-04 Bobo Hua , Florentin Münch

A graph is $k$-planar if it can be drawn in the plane such that no edge is crossed more than $k$ times. While for $k=1$, optimal $1$-planar graphs, i.e., those with $n$ vertices and exactly $4n-8$ edges, have been completely characterized,…

Computational Geometry · Computer Science 2017-03-21 Michael A. Bekos , Michael Kaufmann , Chrysanthi N. Raftopoulou