Related papers: Ricci-flat cubic graphs with girth five

Ricci curvature and Ricci flow have proven to be powerful tools for analyzing the geometry of discrete structures, particularly on undirected graphs, where they have been applied to tasks ranging from community detection to graph…

In this work, we use the Ricci flow approach to study the gap phenomenon of Riemannian manifolds with non-negative curvature and sub-critical scaling invariant curvature decay. The first main result is a quantitative Ricci flow existence…

A graph is pseudo 2-factor isomorphic if all of its 2-factors have the same parity of number of cycles. Abreu et al. [J. Comb. Theory, Ser. B. 98 (2008) 432--442] conjectured that $K_{3,3}$, the Heawood graph and the Pappus graph are the…

Every simple quadrangulation of the sphere is generated by a graph called a pseudo-double wheel with two local expansions (Brinkmann et al. "Generation of simple quadrangulations of the sphere." Discrete Math., Vol. 305, No. 1-3, pp. 33-54,…

Let $G$ be a cyclically $5$-connected cubic graph with a $5$-edge-cut separating $G$ into two cyclic components $G_1$ and $G_2$. We prove that each component $G_i$ can be completed to a cyclically $5$-connected cubic graph by adding three…

A graph with chromatic number $k$ is called $k$-chromatic. Using computational methods, we show that the smallest triangle-free 6-chromatic graphs have at least 32 and at most 40 vertices. We also determine the complete set of all…

Minimal prime graphs are connected graphs on at least two vertices whose complements satisfy the following conditions: triangle-freeness, 3-colorability, and edge-maximality with respect to the latter two properties. These graphs are prime…

We show that a simply-connected closed four-dimensional Ricci flow whose Ricci curvature is uniformly bounded below and whose volume does not approach zero must converge to a $C^{0}$ orbifold at any finite-time singularity, so has an…

We study two measures of uncolourability of cubic graphs, their colouring defect and perfect matching index. The colouring defect of a cubic graph $G$ is the smallest number of edges left uncovered by three perfect matchings; the perfect…

For a number $\ell\geq 2$, let $\mathcal{H}_{\ell}$ denote the family of graphs which have girth $2\ell$ and have no even hole with length greater than $2\ell$. Wu, Xu, and Xu conjectured that every graph in…

Graph Ricci curvature is crucial as it geometrically quantifies network structure. It pinpoints bottlenecks via negative curvature, identifies cohesive communities with positive curvature, and highlights robust hubs. This guides network…

The only open case of Vizing's conjecture that every planar graph with $\Delta\geq 6$ is a class 1 graph is $\Delta = 6$. We give a short proof of the following statement: there is no 6-critical plane graph $G$, such that every vertex of…

We drastically simplify the problem of linearizing a general higher-order theory of gravity. We reduce it to the evaluation of its Lagrangian on a particular Riemann tensor depending on two parameters, and the computation of two derivatives…

A long-standing conjecture of Berge suggests that every bridgeless cubic graph can be expressed as a union of at most five perfect matchings. This conjecture trivially holds for $3$-edge-colourable cubic graphs, but remains widely open for…

We establish a Harnack inequality for finite connected graphs with non-negative Ricci curvature. As a consequence, we derive an eigenvalue lower bound, extending previous results for Ricci flat graphs.

A bipartite graph is {\em pseudo 2--factor isomorphic} if all its 2--factors have the same parity of number of circuits. In \cite{ADJLS} we proved that the only essentially 4--edge-connected pseudo 2--factor isomorphic cubic bipartite graph…

We extend the concept of singular Ricci flow by Kleiner and Lott from 3d compact manifolds to 3d complete manifolds with possibly unbounded curvature. As an application of the generalized singular Ricci flow, we show that for any 3d…

A {\em hole} in a graph is an induced subgraph which is a cycle of length at least four. A hole is called {\em even} if it has an even number of vertices. An {\em even-hole-free} graph is a graph with no even holes. A vertex of a graph is…

A connected r-regular graph, where $r \geq 3$, is an r-graph if each odd cut has at least r edges. Every r-graph is matching covered - a connected graph whose each edge participates in some perfect matching. We set out to: (i) characterize…

In this paper we compare the combinatorial Ricci curvature on cell complexes and the LLY-Ricci curvature defined on graphs. A cell complex is correspondence to a graph such that the vertexes are cells and the edges are vectors on the cell…