中文
相关论文

相关论文: Ricci curvature, diameter and eigenvalues of amply…

200 篇论文

We establish a sharp edge-connectivity estimate for graphs with non-negative Bakry-\'Emery curvature. This leads to a geometric criterion for the existence of a perfect matching. Precisely, we show that any regular graph with non-negative…

组合数学 · 数学 2025-07-25 Kaizhe Chen , Jack H. Koolen , Shiping Liu

Let $G$ be a graph attaining the maximum spectral radius among all connected nonregular graphs of order $n$ with maximum degree $\Delta$. Let $\lambda_1(G)$ be the spectral radius of $G$. A nice conjecture due to Liu, Shen and Wang [On the…

组合数学 · 数学 2022-03-25 Lele Liu

In this paper, we generalize Lin-Lu-Yau's Ricci curvature to weighted graphs and give a simple limit-free definition. We prove two extremal results on the sum of Ricci curvatures for weighted graph. A weighted graph $G=(V,E,d)$ is an…

组合数学 · 数学 2020-11-10 Shuliang Bai , An Huang , Linyuan Lu , Shing-Tung Yau

In this paper, we prove a theorem on tight paths in convex geometric hypergraphs, which is asymptotically sharp in infinitely many cases. Our geometric theorem is a common generalization of early results of Hopf and Pannwitz [12],…

We give a new bound on the parameter $\lambda$ (number of common neighbors of a pair of adjacent vertices) in a distance-regular graph $G$, improving and generalizing bounds for strongly regular graphs by Spielman (1996) and Pyber (2014).…

组合数学 · 数学 2015-03-11 László Babai , John Wilmes

In this paper, we reformulate the Bakry-\'Emery curvature on a weighted graph in terms of the smallest eigenvalue of a rank one perturbation of the so-called curvature matrix using Schur complement. This new viewpoint allows us to show…

组合数学 · 数学 2022-01-26 David Cushing , Supanat Kamtue , Shiping Liu , Norbert Peyerimhoff

A well known upper bound for the spectral radius of a graph, due to Hong, is that $\mu_1^2 \le 2m - n + 1$. It is conjectured that for connected graphs $n - 1 \le s^+ \le 2m - n + 1$, where $s^+$ denotes the sum of the squares of the…

组合数学 · 数学 2015-09-21 Clive Elphick , Felix Goldberg , Miriam Farber , Pawel Wocjan

We prove that for each $d\geq 3$ and $k\geq 2$, the set of limit points of the first $k$ eigenvalues of sequences of $d$-regular graphs is \[ \{(\mu_1,\dots,\mu_k): d=\mu_1\geq \dots\geq \mu_{k}\geq2\sqrt{d-1}\}. \] The result for $k=2$ was…

谱理论 · 数学 2024-12-13 Dingding Dong , Theo McKenzie

Let $\Gamma$ denote a distance-regular graph with diameter $D\geq 3$. Juri\v{s}i\'c and Vidali conjectured that if $\Gamma$ is tight with classical parameters $(D,b,\alpha,\beta)$, $b\geq 2$, then $\Gamma$ is not locally the block graph of…

组合数学 · 数学 2024-05-13 Jack H. Koolen , Jae-Ho Lee , Shuang-Dong Li , Yun-Han Li , Xiaoye Liang , Ying-Ying Tan

We show that for every prime $d$ and $\alpha\in (0,1/6)$, there is an infinite sequence of $(d+1)$-regular graphs $G=(V,E)$ with girth at least $2\alpha \log_{d}(|V|)(1-o_d(1))$, second adjacency matrix eigenvalue bounded by…

组合数学 · 数学 2019-08-13 Noga Alon , Shirshendu Ganguly , Nikhil Srivastava

A graph is called diameter-$k$-critical if its diameter is $k$, and the removal of any edge strictly increases the diameter. In this paper, we prove several results related to a conjecture often attributed to Murty and Simon, regarding the…

组合数学 · 数学 2014-06-27 Po-Shen Loh , Jie Ma

We determine new upper bounds for the clique numbers of strongly regular graphs in terms of their parameters. These bounds improve on the Delsarte bound for infinitely many feasible parameter tuples for strongly regular graphs, including…

组合数学 · 数学 2019-01-31 Gary R. W. Greaves , Leonard H. Soicher

We show that the intrinsic diameter of mean curvature flow in $\mathbb{R}^3$ is uniformly bounded as one approaches the first singular time $T$. This confirms the bounded diameter conjecture of Haslhofer. In addition, we establish several…

微分几何 · 数学 2025-10-23 Yiqi Huang , Wenshuai Jiang

A $t$-walk-regular graph is a graph for which the number of walks of given length between two vertices depends only on the distance between these two vertices, as long as this distance is at most $t$. Such graphs generalize distance-regular…

组合数学 · 数学 2015-11-25 Marc Cámara , Edwin R. van Dam , Jack H. Koolen , Jongyook Park

In this paper we consider global $\theta$-curvatures of finite Markov chains with associated means $\theta$ in the spirit of the entropic curvature (based on the logarithmic mean) by Erbar-Maas and Mielke. As in the case of Bakry-\'Emery…

微分几何 · 数学 2025-04-01 Supanat Kamtue , Shiping Liu , Florentin Münch , Norbert Peyerimhoff

A non-complete geometric distance-regular graph is the point graph of a partial geometry in which the set of lines is a set of Delsarte cliques. In this paper, we prove that for fixed integer $m\geq 2$, there are only finitely many…

组合数学 · 数学 2009-08-17 J. H. Koolen , S. Bang

We prove that the diameter of the commuting graph of the full ma- trix ring over the real numbers is at most five. This answers, in the affir- mative, a conjecture proposed by Akbari-Mohammadian-radjavi-Raja, for the special case of the…

环与代数 · 数学 2013-01-11 C. Miguel

Diameter estimates for K\"ahler metrics are established which require only an entropy bound and no lower bound on the Ricci curvature. The proof builds on recent PDE techniques for $L^\infty$ estimates for the Monge-Amp\`ere equation, with…

微分几何 · 数学 2022-09-21 Bin Guo , Duong H. Phong , Jian Song , Jacob Sturm

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…

组合数学 · 数学 2019-02-28 Michael Haythorpe

Tan et al. conjectured that connected co-edge-regular graphs with four distinct eigenvalues and fixed smallest eigenvalue, when having sufficiently large valency, belong to two different families of graphs. In this paper we construct two…

组合数学 · 数学 2025-03-18 Hong-Jun Ge , Jack H. Koolen