Related papers: Ricci-flat graphs with maximum degree at most 4
We prove that the geometric thickness of graphs whose maximum degree is no more than four is two. All of our algorithms run in O(n) time, where n is the number of vertices in the graph. In our proofs, we present an embedding algorithm for…
An almost self-centered graph is a connected graph of order $n$ with exactly $n-2$ central vertices, and an almost peripheral graph is a connected graph of order $n$ with exactly $n-1$ peripheral vertices. We determine (1) the maximum girth…
We study minimal graphic functions on complete Riemannian manifolds $\Si$ with non-negative Ricci curvature, Euclidean volume growth and quadratic curvature decay. We derive global bounds for the gradients for minimal graphic functions of…
Let $(M,g)$ be a compact Ricci-flat 4-manifold. For $p \in M$ let $K_{max}(p)$ (respectively $K_{min}(p)$) denote the maximum (respectively the minimum) of sectional curvatures at $p$. We prove that if $$K_{max} (p) \le \ -c K_{min}(p)$$…
We give a classification of all connected quartic graphs which are (infinity) curvature sharp in all vertices with respect to Bakry-\'Emery curvature. The result is based on a computer classification by F. Gurr and L. Watson May and a…
We prove Li-Yau type gradient bounds for the heat equation either on manifolds with fixed metric or under the Ricci flow. In the former case the curvature condition is $|Ric^-| \in L^p$ for some $p>n/2$, or $\sup_\M \int_\M…
A graph is called $k$-critical if its chromatic number is $k$ but any proper subgraph has chromatic number less than $k$. An old and important problem in graph theory asks to determine the maximum number of edges in an $n$-vertex…
We introduce two constructions to obtain left-invariant Ricci-flat pseudo-Riemannian metrics on nilpotent Lie groups, one based on gradings, the other on filtrations, both depending on the combinatorics of the set of weights. As an…
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…
In a previous work, the authors have introduced a Lin-Lu-Yau type Ricci curvature for directed graphs, and obtained a diameter comparison of Bonnet-Myers type. In this paper, we investigate rigidity properties for the equality case, and…
For a given graph consider a pair of disjoint matchings the union of which contains as many edges as possible. Furthermore, consider the relation of the cardinalities of a maximum matching and the largest matching in those pairs. It is…
A graph is called $2K_2$-free if it does not contain two independent edges as an induced subgraph. Mou and Pasechnik conjectured that every $\frac{3}{2}$-tough $2K_2$-free graph with at least three vertices has a spanning trail with maximum…
We explore the interaction between connectivity and Lin-Lu-Yau curvature of graphs systematically. The intuition is that connected graphs with large Lin-Lu-Yau curvature also have large connectivity, and vice versa. We prove that the…
In this paper, we define the $4$-girth-thickness $\theta(4,G)$ of a graph $G$ as the minimum number of planar subgraphs of girth at least $4$ whose union is $G$. We obtain the $4$-girth-thickness of the arbitrary complete graph $K_n$…
A graph is called an $(r,k)$-graph if its vertex set can be partitioned into $r$ parts, each having at most $k$ vertices and there is at least one edge between any two parts. Let $f(r,H)$ be the minimum $k$ for which there exists an…
In this note we prove the following result: Let $X$ be a complete, connected 4-manifold with uniformly positive isotropic curvature, with bounded geometry and with no essential incompressible space form. Then $X$ is diffeomorphic to…
A simple graph $G$ is \emph{overfull} if $|E(G)|>\Delta\lfloor|V(G)|/2\rfloor$. By the pigeonhole principle, every overfull graph $G$ has $\chi'(G)>\Delta$. The \emph{core} of a graph, denoted $G_\Delta$, is the subgraph induced by its…
For undirected graphs, the Ricci curvature introduced by Lin-Lu-Yau has been widely studied from various perspectives, especially geometric analysis. In the present paper, we discuss generalization problem of their Ricci curvature for…
In this paper, we classify unweighted graphs satisfying the curvature dimension condition CD(0,\infty) whose girth are at least five.
The famous Gallai's Conjecture states that any connected graph with n vertices has a path decomposition containing at most (n+1)/2 paths. In this note, we explore graphs generated from removing edges from complete graphs. We first provide…