English
Related papers

Related papers: Erratum for Ricci-flat graphs with girth at least …

200 papers

In \cite{reed97}, Reed conjectures that the inequality $\chi (G) \leq \left \lceil \textstyle {1/2} (\omega (G) + \Delta (G) + 1) \right \rceil$ holds for any graph $G$. We prove this holds for a graph $G$ if $\bar{G}$ is disconnected. From…

Combinatorics · Mathematics 2007-05-23 landon rabern

We present a short way of proving the inequalities obtained by Wright in [Journal of Graph Theory, 4: 393 - 407 (1980)] concerning the number of connected graphs with $\ell$ edges more than vertices.

Discrete Mathematics · Computer Science 2007-06-14 Vlady Ravelomanana

We present a string inspired 3D Euclidean field theory as the starting point for a modified Ricci flow analysis of the Thurston conjecture. In addition to the metric, the theory contains a dilaton, an antisymmetric tensor field and a…

High Energy Physics - Theory · Physics 2009-11-10 J. Gegenberg , G. Kunstatter

A complex unit gain graph (or ${\mathbb T}$-gain graph) is a triple $\Phi=(G, {\mathbb T}, \varphi)$ (or $(G, \varphi)$ for short) consisting of a simple graph $G$, as the underlying graph of $(G, \varphi)$, the set of unit complex numbers…

Combinatorics · Mathematics 2020-01-07 Shengjie He , Rong-Xia Hao , Fengming Dong

Connections between continuous and discrete worlds tend to be elusive. One example is curvature. Even though there exist numerous nonequivalent definitions of graph curvature, none is known to converge in any limit to any traditional…

In 2018, Dankelmann, Gao, and Surmacs [J. Graph Theory, 88(1): 5--17, 2018] established sharp bounds on the oriented diameter of a bridgeless undirected graph and a bridgeless undirected bipartite graph in terms of vertex degree. In this…

Combinatorics · Mathematics 2025-07-04 Ran An , Hengzhe Li , Jianbing Liu , Gaoxing Sun

In 1979 Frankl conjectured that in a finite non-trivial union-closed collection of sets there has to be an element that belongs to at least half the sets. We show that this is equivalent to the conjecture that in a finite non-trivial graph…

Combinatorics · Mathematics 2013-05-17 Henning Bruhn , Pierre Charbit , Oliver Schaudt , Jan Arne Telle

In this paper we prove a gap theorem for K\"ahler manifolds with nonnegative orthogonal bisectional curvature and nonnegative Ricci curvature, which generalizes an earlier result of the first author. We also prove a Liouville theorem for…

Differential Geometry · Mathematics 2017-08-14 Lei Ni , Yanyan Niu

We propose two conjectures about Ricci-flat metrics: Conjecture 1: A Ricci-flat projectively induced metric is flat. Conjecture 2: A Ricci-flat metric on an $n$-dimensional complex manifold such that the $a_{n+1}$ coefficient of the TYZ…

Differential Geometry · Mathematics 2017-12-20 Andrea Loi , Filippo Salis , Fabio Zuddas

A finite graph is called a tricirculant if admits a cyclic group of automorphism which has precisely three orbits on the vertex-set of the graph, all of equal size. We classify all finite connected cubic vertex-transitive tricirculants. We…

Combinatorics · Mathematics 2018-12-12 Primož Potočnik , Micael Toledo

We prove lower bounds for the fraction of edges of an $r$-graph which can be covered by the union of $k$ 1-factors. The special case $r=3$ yields some known results for cubic graphs. Furthermore, we introduce the concept of…

Combinatorics · Mathematics 2019-10-07 Ligang Jin , Eckhard Steffen

Let $G$ be a graph with adjacency eigenvalues $\lambda_1 \geq \cdots \geq \lambda_n$. Both $\lambda_1 + \lambda_n$ and the odd girth of $G$ can be seen as measures of the bipartiteness of $G$. Csikv\'ari proved in 2022 that for odd girth 5…

Combinatorics · Mathematics 2025-07-24 Aida Abiad , Vladislav Taranchuk , Thijs van Veluw

Consider the family of all finite graphs with maximum degree $\Delta(G)<d$ and matching number $\nu(G)<m$. In this paper we give a new proof to obtain the exact upper bound for the number of edges in such graphs and also characterize all…

Combinatorics · Mathematics 2007-05-23 Niranjan Balachandran , Niraj Khare

We realize higher-form symmetries in F-theory compactifications on non-compact elliptically fibered Calabi-Yau manifolds. Central to this endeavour is the topology of the boundary of the non-compact elliptic fibration, as well as the…

High Energy Physics - Theory · Physics 2022-08-24 Max Hubner , David R. Morrison , Sakura Schafer-Nameki , Yi-Nan Wang

We construct a spectral sequence that converges to the cohomology of the chiral de Rham complex over a Calabi-Yau hypersurface and whose first term is a vertex algebra closely related to the Landau-Ginburg orbifold. As an application, we…

Algebraic Geometry · Mathematics 2007-05-23 V. Gorbounov , F. Malikov

In [{Structural properties and decomposition of linear balanced matrices}, {\it Mathematical Programming}, 55:129--168, 1992], Conforti and Rao conjectured that every balanced bipartite graph contains an edge that is not the unique chord of…

The paper focuses on two problems: (i) how to orient the edges of an undirected graph in order to maximize the number of ordered vertex pairs (x,y) such that there is a directed path from x to y, and (ii) how to orient the edges so as to…

Data Structures and Algorithms · Computer Science 2015-06-02 S. L. Hakimi , E. Schmeichel , Neal E. Young

In a previous paper, the first two authors classified complete Ricci-flat ALF Riemannian 4-manifolds that are toric and Hermitian, but non-Kaehler. In this article, we consider general Ricci-flat deformations of such spaces, assuming only…

Differential Geometry · Mathematics 2023-11-14 Olivier Biquard , Paul Gauduchon , Claude LeBrun

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…

Differential Geometry · Mathematics 2024-12-11 Diego Conti

We point out two flaws in the algorithm of Brandes and K\"opf (Proc. GD 2001), which is often used for the horizontal coordinate assignment in Sugiyama's framework for layered layouts. One of them has been noted and fixed multiple times,…

Data Structures and Algorithms · Computer Science 2020-08-05 Ulrik Brandes , Julian Walter , Johannes Zink
‹ Prev 1 8 9 10 Next ›