In this note, we prove the sharp DaviesGaffneyGrigoryan Lemma for minimal heat kernels on graphs.

In 1975, P. Erd\H os proposed the problem of determining the maximum number $f(n)$ of edges in a graph on $n$ vertices in which any two cycles are of different lengths. Let $f^{\ast}(n)$ be the maximum number of edges in a simple graph on $n$ vertices in which any two cycles are of different lengths. Let $M_n$ be the set of simple graphs on $n$ vertices in which any two cycles are of different lengths and with the edges of $f^{\ast}(n)$. Let $mc(n)$ be the maximum cycle length for all $G \in M_n$. In this paper, it is proved that for $n$ sufficiently large, $mc(n)\leq \frac{15}{16}n.$ \par We make the following conjecture: \par \bigskip \noindent{\bf Conjecture.} $$\lim_{n \rightarrow \infty} {mc(n)\over n}= 0.$$

We investigate quantum graphs with infinitely many vertices and edges without the common restriction on the geometry of the underlying metric graph that there is a positive lower bound on the lengths of its edges. Our central result is a close connection between spectral properties of a quantum graph and the corresponding properties of a certain weighted discrete Laplacian on the underlying discrete graph. Using this connection together with spectral theory of (unbounded) discrete Laplacians on infinite graphs, we prove a number of new results on spectral properties of quantum graphs. Namely, we prove several self-adjointness results including a Gaffney-type theorem. We investigate the problem of lower semiboundedness, prove several spectral estimates (bounds for the bottom of spectra and essential spectra of quantum graphs, CLR-type estimates) and study spectral types.

We associate to a finite digraph D a lattice polytope PD whose vertices are the rows of the Laplacian matrix of D. This generalizes a construction introduced by Braun and the third author. As a consequence of the Matrix-Tree Theorem, we show that the normalized volume of PD equals the complexity of D, and PD contains the origin in its relative interior if and only if D is strongly connected. Interesting connections with other families of simplices are established and then used to describe reflexivity, the h∗-polynomial, and the integer decomposition property of PD in these cases. We extend Braun and Meyer’s study of cycles by considering cycle digraphs. In this setting, we characterize reflexivity and show there are only four non-trivial reflexive Laplacian simplices having the integer decomposition property.

We study pretty good quantum state transfer (ie, state transfer that becomes arbitrarily close to perfect) between vertices of graphs with an involution in the presence of an energy potential. In particular, we show that if a graph has an involution that fixes at least one vertex or at least one edge, then there exists a choice of potential on the vertex set of the graph for which we get pretty good state transfer between symmetric vertices of the graph. We show further that in many cases, the potential can be chosen so that it is only non-zero at the vertices between which we want pretty good state transfer. As a special case of this, we show that such a potential can be chosen on the endpoints of a path to induce pretty good state transfer in paths of any length. This is in contrast to the result of [6], in which the authors show that there cannot be perfect state transfer in paths of length 4 or more, no matter what potential is chosen.

We introduce the notion of Bonnet-Myers and Lichnerowicz sharpness in the Ollivier Ricci curvature sense. Our main result is a classification of all self-centered Bonnet-Myers sharp graphs (hypercubes, cocktail party graphs, even-dimensional demi-cubes, Johnson graphs , the Gosset graph J(2n, n) and suitable Cartesian products). We also present a purely combinatorial reformulation of this result. We show that Bonnet-Myers sharpness implies Lichnerowicz sharpness and classify all distance-regular Lichnerowicz sharp graphs under the additional condition θ_1=b_1-1. We also relate Bonnet-Myers sharpness to an upper bound of Bakry-Émery ∞-curvature, which motivates a general conjecture about Bakry-Émery ∞-curvature.

We prove a homology vanishing theorem for graphs with positive Bakry-\'Emery curvature, analogous to a classic result of Bochner on manifolds\cite {Bochner}. Specifically, we prove that if a graph has positive curvature at every vertex, then its first homology group is trivial, where the notion of homology that we use for graphs is the path homology developed by Grigor'yan, Lin, Muranov, and Yau\cite {Grigoryan2}.%\Hm {added the fundamental group curvature relation} We moreover prove that the fundamental group is finite for graphs with positive Bakry-\'Emery curvature, analogous to a classic result of Myers on manifolds\cite {Myers1941}. The proofs draw on several separate areas of graph theory. We study graph coverings, gain graphs, and cycle spaces of graphs, in addition to the Bakry-\'Emery curvature and the path homology. The main results follow as a consequence of several different relationships developed among these different areas. Specifically, we show that a graph with positive curvature can have no non-trivial infinite cover preserving 3-cycles and 4-cycles, and give a combinatorial interpretation of the first path homology in terms of the cycle space of a graph. We relate cycle spaces of graphs to gain graphs with abelian gain group, and relate these to coverings of graphs. Along the way, we prove other new facts about gain graphs, coverings, and cycles spaces that are of related interest. Furthermore, we relate gain graphs to graph homotopy and the fundamental group developed by Grigor'yan, Lin, Muranov, and Yau\cite {Grigoryan_homotopy}, and obtain an alternative proof to their result that the abelianization of the fundamental

The set of all non-increasing nonnegative integers sequence $\pi=$ ($d(v_1 ),$ $d(v_2 ),$ $...,$ $d(v_n )$) is denoted by $NS_n$. A sequence $\pi\in NS_n$ is said to be graphic if it is the degree sequence of a simple graph $G$ on $n$ vertices, and such a graph $G$ is called a realization of $\pi$. The set of all graphic sequences in $NS_n$ is denoted by $GS_n$. A graphical sequence $\pi$ is potentially $H$-graphical if there is a realization of $\pi$ containing $H$ as a subgraph, while $\pi$ is forcibly $H$-graphical if every realization of $\pi$ contains $H$ as a subgraph. Let $K_k$ denote a complete graph on $k$ vertices. Let $K_{m}-H$ be the graph obtained from $K_{m}$ by removing the edges set $E(H)$ of the graph $H$ ($H$ is a subgraph of $K_{m}$). This paper summarizes briefly some recent results on potentially $K_{m}-G$-graphic sequences and give a useful classification for determining $\sigma(H,n)$.

No abstract uploaded!

No abstract uploaded!

We construct small cancellation labellings for some infinite sequences of finite graphs of bounded degree. We use them to define infinite graphical small cancellation presentations of groups. This technique allows us to provide examples of groups with exotic properties: • We construct the first examples of finitely generated coarsely non-amenable groups (that is, groups without Guoliang Yu’s Property A) that are coarsely embeddable into a Hilbert space. Moreover, our groups act properly on CAT(0) cubical complexes. • We construct the first examples of finitely generated groups, with expanders embedded isometrically into their Cayley graphs—in contrast, in the case of the Gromov monster expanders are not even coarsely embedded. We present further applications.

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., 2009. A graph is Ricci-flat, if it has vanishing Ricci curvature on all edges. We show, that the only Ricci-flat cubic graphs with girth at least 5 are the Petersen graph, the Triplex and the dodecahedral graph. This will correct the classification in Lin-Lu-Yau, Comm. Anal. Geom., 2014, that misses the Triplex.

No abstract uploaded!

This erratum will correct the classification of Theorem 1 in Lin-Lu-Yau, Comm. Anal. Geom., 2014, that misses the Triplex graph.

We prove a Harnack inequality for Dirichlet eigenfunctions of abelian homogeneous graphs and their convex subgraphs. We derive lower bounds for Dirichlet eigenvalues using the Harnack inequality. We also consider a randomization problem in connection with combinatorial games using Dirichlet eigenvalues. 2000 John Wiley & Sons, Inc. J Graph Theory 34: 247257, 2000

In a graph G, for a subset S of the vertex set, the induced subgraph determined by S has edge set consisting of all edges of G with both endpoints in S. The (edge) boundary, denoted by S consists of all edges containing one endpoint in S and one endpoint not in S.

No abstract uploaded!

For any r-order {0,1}-tensor A with e ones, we prove that the spectral radius of A is at most exp((r-1)/r) with the equality holds if and only if e=k^r for some integer k and all ones forms a principal sub-tensor 1_{k x k x ... x k}. We also prove a stability result for general tensor A with e ones where e = k^r+l with relatively small l. Using the stability result, we completely characterized the tensors achieving the maximum spectral radius among all r-order {0,1}-tensor A with k^r+l ones, for -r-1 ≤ l ≤ r, and k sufficiently large.

By studying the heat semigroup, we prove Li-Yau type estimates for bounded and positive solutions of the heat equation on graphs, under the assumption of the curvature-dimension inequality $CDE'(n,0)$, which can be consider as a notion of curvature for graphs. Furthermore, we derive that if a graph has non-negative curvature then it has the volume doubling property, from this we can prove the Gaussian estimate for heat kernel, and then Poincar\'{e} inequality and Harnack inequality. As a consequence, we obtain that the dimension of space of harmonic functions on graphs with polynomial growth is finite, which original is a conjecture of Yau on Riemannian manifold proved by Colding and Minicozzi. Under the assumption of positive curvature on graphs, we derive the Bonnet-Myers type theorem that the diameter of graphs is finite and bounded above in terms of the positive curvature by proving some Log Sobolev inequalities.

In this paper, we give the sharp upper bound for the number of vertices with positive curvature in a planar graph with nonnegative combinatorial curvature. Based on this, we show that the automorphism group of a planar—possibly infinite—graph with nonnegative combinatorial curvature and positive total curvature is a finite group, and give an upper bound estimate for the order of the group.

We study the cluster combinatorics of d-cluster tilting objects in d-cluster categories. Using mutations of maximal rigid objects in d-cluster categories, which are defined in a similar way to mutations for d-cluster tilting objects, we prove the equivalences between d-cluster tilting objects, maximal rigid objects and complete rigid objects. Using the chain of d+1 triangles of d-cluster tilting objects in [O. Iyama, Y. Yoshino, Mutations in triangulated categories and rigid Cohen–Macaulay modules, Invent. Math. 172 (1) (2008) 117–168], we prove that any almost complete d-cluster tilting object has exactly d+1 complements, compute the extension groups between these complements, and study the middle terms of these d+1 triangles. All results are the extensions of corresponding results on cluster tilting objects in cluster categories established for d-cluster categories in [A. Buan, R. Marsh, M. Reineke, I. Reiten, G. Todorov, Tilting theory and cluster combinatorics, Adv. Math. 204 (2006) 572–618]. They are applied to the Fomin–Reading generalized cluster complexes of finite root systems defined and studied in [S. Fomin, N. Reading, Generalized cluster complexes and Coxeter combinatorics, Int. Math. Res. Not. 44 (2005) 2709–2757; H. Thomas, Defining an m-cluster category, J. Algebra 318 (2007) 37–46; K. Baur, R. Marsh, A geometric description of m-cluster categories, Trans. Amer. Math. Soc. 360 (2008) 5789–5803; K. Baur, R. Marsh, A geometric description of the m-cluster categories of type D_n, preprint, arXiv:math.RT/0610512; see also Int. Math. Res. Not. 2007 (2007), doi:10.1093/imrn/rnm011], and to that of infinite root systems [B. Zhu, Generalized cluster complexes via quiver representations, J. Algebraic Combin. 27 (2008) 25–54].

The CD inequalities are introduced to imply the gradient estimate of Laplace operator on graphs. This article is based on the unbounded Laplacians, and finally concludes some equivalent properties of the CD(K,1) and CD(K,n).

In this paper, we give a complete classification of cotorsion pairs in a cluster category C of type A^\infty_\infty via certain configurations of arcs, called τ-compact Ptolemy diagrams, in an infinite strip with marked points. As applications, we classify t-structures and functorially finite rigid subcategories in C, respectively. We also deduce Liu-Paquette's classification of cluster tilting subcategories of C and Ng's classification of torsion pairs in the cluster category of type A^\infty_\infty.

We establish a new on-diagonal lower estimate of continuous-time heat kernels for large time on graphs. To achieve the goal, we first introduce an upper estimate of heat kernels in natural graph metric, then use the upper estimate and the volume growth condition to show the validity of the on-diagonal lower estimate.

We explore the tunneling behavior of a quantum particle on a finite graph in the presence of an asymptotically large potential with two or three potential wells. The behavior of the particle is primarily governed by the local spectral symmetry of the graph around the wells. In the case of two wells the behavior is stable in the sense that it can be predicted from a sufficiently large neighborhood of the wells. However in the case of three wells we are able to exhibit examples where the tunneling behavior can be changed significantly by perturbing the graph arbitrarily far from the wells.