English
Related papers

Related papers: Ricci-flat cubic graphs with girth five

200 papers

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…

Differential Geometry · Mathematics 2020-07-07 Ryunosuke Ozawa , Yohei Sakurai , Taiki Yamada

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

For positive integers $s,t,u,v$, we define a bipartite graph $\Gamma_{\mathbb{R}}(X^s Y^t,X^u Y^v)$ where each partite set is a copy of $\mathbb{R}^3$, and a vertex $(a_1,a_2,a_3)$ in the first partite set is adjacent to a vertex…

Combinatorics · Mathematics 2021-01-26 Alex Kodess , Brian G. Kronenthal , Diego Manzano-Ruiz , Ethan Noe

The Pancake graphs $P_n, n\geqslant 2$, are Cayley graphs over the symmetric group $\mathrm{Sym}_n$ generated by prefix-reversals. There are six generating sets of prefix-reversals of cardinality three which give connected Cayley graphs…

Combinatorics · Mathematics 2022-09-21 Elena V. Konstantinova , Son En Gun

Curvature is a fundamental geometric characteristic of smooth spaces. In recent years different notions of curvature have been developed for combinatorial discrete objects such as graphs. However, the connections between such discrete…

Probability · Mathematics 2023-11-09 Pim van der Hoorn , Gabor Lippner , Carlo Trugenberger , Dmitri Krioukov

Complex Ricci-flat (i.e., Calabi-Yau) hypersurfaces in spaces admitting a maximal (toric) $U(1)^n$ gauge symmetry of general type (encoded by certain non-convex and multi-layered multitopes) may degenerate, but can be smoothed by rational…

High Energy Physics - Theory · Physics 2025-01-22 Tristan Hübsch

Let $G$ be a bridgeless cubic graph, and $\mu_2(G)$ the minimum number $k$ such that two 1-factors of $G$ intersect in $k$ edges. A cyclically $n$-edge-connected cubic graph $G$ has a nowhere-zero 5-flow if (1) $n \geq 6$ and $\mu_2(G) \leq…

Combinatorics · Mathematics 2016-09-05 Eckhard Steffen

Let G be a bridgeless cubic graph. A well-known conjecture of Berge and Fulkerson can be stated as follows: there exist five perfect matchings of G such that each edge of G is contained in at least one of them. Here, we prove that in each…

Combinatorics · Mathematics 2013-06-06 Giuseppe Mazzuoccolo

We give topological conditions to ensure that a noncollapsed almost Ricci-flat 4-manifold admits a Ricci-flat metric. One sufficient condition is that the manifold is spin and has a nonzero A-hat genus. Another condition is that the…

Differential Geometry · Mathematics 2017-10-17 Vitali Kapovitch , John Lott

The perfect matching index of a cubic graph $G$, denoted by $\pi(G)$, is the smallest number of perfect matchings that cover all the edges of $G$. According to the Berge-Fulkerson conjecture, $\pi(G)\le5$ for every bridgeless cubic…

Combinatorics · Mathematics 2020-08-12 Edita Máčajová , Martin Škoviera

In this paper, we introduce a new notion of curvature on the edges of a graph that is defined in terms of effective resistances. We call this the Ricci--Foster curvature. We study the Ricci flow resulting from this curvature. We prove the…

Combinatorics · Mathematics 2024-03-05 Aleyah Dawkins , Vishal Gupta , Mark Kempton , William Linz , Jeremy Quail , Harry Richman , Zachary Stier

We say that a graph $G$ has an {\em odd $K_4$-subdivision} if some subgraph of $G$ is isomorphic to a $K_4$-subdivision and whose faces are all odd holes of $G$. For a number $\ell\geq 2$, let $\mathcal{G}_{\ell}$ denote the family of…

Combinatorics · Mathematics 2024-01-03 Rong Chen , Yidong Zhou

A nut graph is a nontrivial simple graph whose adjacency matrix contains a one-dimensional null space spanned by a vector without zero entries. Moreover, an $\ell$-circulant graph is a graph that admits a cyclic group of automorphisms…

Combinatorics · Mathematics 2025-06-09 Nino Bašić , Ivan Damnjanović

Contraction of triangles is a standard operation in the study of cubic graphs, as it reduces the order of the graph while typically preserving many of its properties. In this paper, we investigate the converse problem, wherein certain…

Combinatorics · Mathematics 2025-04-29 Giuseppe Mazzuoccolo , Vahan Mkrtchyan

It is shown that a simple graph which is embeddable in the real projective plane is minimally 3-rigid if and only if it is (3,6)-tight. Moreover the topologically uncontractible embedded graphs of this type are constructible from one of 8…

Combinatorics · Mathematics 2023-02-20 Eleftherios Kastis , Stephen Power

Given a contact 3-manifold we consider the problem of when a given function can be realized as the Ricci curvature of a Reeb vector field for the contact structure. We will use topological tools to show that every admissible function can be…

Differential Geometry · Mathematics 2021-04-20 Surena Hozoori

We develop a sparse graph regularity method that applies to graphs with few 4-cycles, including new counting and removal lemmas for 5-cycles in such graphs. Some applications include: * Every $n$-vertex graph with no 5-cycle can be made…

Combinatorics · Mathematics 2021-09-28 David Conlon , Jacob Fox , Benny Sudakov , Yufei Zhao

We study minimal graphs with linear growth on complete manifolds $M^m$ with $\mathrm{Ric} \ge 0$. Under the further assumption that the $(m-2)$-th Ricci curvature in radial direction is bounded below by $C r(x)^{-2}$, we prove that any such…

Differential Geometry · Mathematics 2024-08-28 Giulio Colombo , Eddygledson Souza Gama , Luciano Mari , Marco Rigoli

Let G be a cubic graph, with girth at least five, such that for every partition X,Y of its vertex set with |X|,|Y|>6 there are at least six edges between X and Y. We prove that if there is no homeomorphic embedding of the Petersen graph in…

Combinatorics · Mathematics 2014-03-11 Neil Robertson , Paul Seymour , Robin Thomas

We show that if $G$ is a simple triangle-free graph with $n\geq 3$ vertices, without a perfect matching, and having a minimum degree at least $\frac{n-1}{2}$, then $G$ is isomorphic either to $C_5$ or to $K_{\frac{n-1}{2},\frac{n+1}{2}}$.

Discrete Mathematics · Computer Science 2015-03-17 Vahan V. Mkrtchyan , Petros A. Petrosyan
‹ Prev 1 4 5 6 7 8 10 Next ›