English
Related papers

Related papers: Local structures in polyhedral maps on surfaces, a…

200 papers

A proof labelling scheme for a graph class $\mathcal{C}$ is an assignment of certificates to the vertices of any graph in the class $\mathcal{C}$, such that upon reading its certificate and the certificates of its neighbors, every vertex…

Combinatorics · Mathematics 2022-03-01 Louis Esperet , Benjamin Lévêque

We investigate the structure of conformally rigid graphs. Graphs are conformally rigid if introducing edge weights cannot increase (decrease) the second (last) eigenvalue of the Graph Laplacian. Edge-transitive graphs and distance-regular…

Combinatorics · Mathematics 2025-06-26 João Gouveia , Stefan Steinerberger , Rekha R. Thomas

Originating from spectral graph theory, cospectrality is a powerful generalization of exchange symmetry and can be applied to all real-valued symmetric matrices. Two vertices of an undirected graph with real edge weights are cospectral iff…

Combinatorics · Mathematics 2021-04-19 Christian V. Morfonios , Maxim Pyzh , Malte Röntgen , Peter Schmelcher

A recent result of Chepoi, Estellon and Vaxes [DCG '07] states that any planar graph of diameter at most 2R can be covered by a constant number of balls of size R; put another way, there are a constant-sized subset of vertices within which…

Computational Geometry · Computer Science 2014-04-01 Glencora Borradaile , Erin Wolf Chambers

An edge $e$ of a matching covered graph $G$ is removable if $G-e$ is also matching covered. Carvalho, Lucchesi, and Murty showed that every brick $G$ different from $K_4$ and $\overline{C_6}$ has at least $\Delta-2$ removable edges, where…

Combinatorics · Mathematics 2024-08-07 Deyu Wu , Yipei Zhang , Xiumei Wang

Let $G=(V,E)$ be a finite, simple, connected, combinatorial graph on $n$ vertices and let $D \in \mathbb{R}^{n \times n}$ be its graph distance matrix $D_{ij} = d(v_i, v_j)$. Steinerberger (J. Graph Theory, 2023) empirically observed that…

Let M be an almost Hermitian manifold of dimension greater or equal to 6. The following theorems are proved: Theorem 1. If M is of pointwise constant {\theta}-holomorphic sectional curvature for a number {\theta} in (0,{\pi}/2) then M is of…

Differential Geometry · Mathematics 2010-09-15 Ognian Kassabov

E. Calabi and J. Cao showed that a closed geodesic of least length in a two-sphere with nonnegative curvature is always simple. Using min-max theory, we prove that for some higher dimensions, this result holds without assumptions on the…

Differential Geometry · Mathematics 2016-12-08 Antoine Song

A graph $G$ is $k$-locally sparse if for each vertex $v \in V(G)$, the subgraph induced by its neighborhood contains at most $k$ edges. Alon, Krivelevich, and Sudakov showed that for $f > 0$ if a graph $G$ of maximum degree $\Delta$ is…

Combinatorics · Mathematics 2025-12-17 James Anderson , Abhishek Dhawan , Aiya Kuchukova

We investigate properties of spatial graphs on the standard torus. It is known that nontrivial embeddings of planar graphs in the torus contain a nontrivial knot or a nonsplit link due to [1],[2]. Building on this and using the chirality of…

Geometric Topology · Mathematics 2019-05-06 Senja Barthel

An embedded cubic graph consisting of segments of geodesics such that the angles at any vertex are equal to $2\pi/3$ is a closed local minimal net. This net is regular if all segments of geodesics are equal. The problem of classification of…

Differential Geometry · Mathematics 2007-05-23 A. Vdovina , E. Selivanova

We prove distance bounds for graphs possessing positive Bakry-\'Emery curvature apart from an exceptional set, where the curvature is allowed to be non-positive. If the set of non-positively curved vertices is finite, then the graph admits…

Differential Geometry · Mathematics 2019-03-26 Shiping Liu , Florentin Münch , Norbert Peyerimhoff , Christian Rose

A mixed extension of a graph $G$ is a graph $H$ obtained from $G$ by replacing each vertex of $G$ by a clique or a coclique, where vertices of $H$ coming from different vertices of $G$ are adjacent if and only if the original vertices are…

Combinatorics · Mathematics 2018-03-02 Willem H. Haemers

For a graph $G$ and a hereditary property $\mathcal{P}$, let $\text{ex}(G,\mathcal{P})$ denote the maximum number of edges of a subgraph of $G$ that belongs to $\mathcal{P}$. We prove that for every non-trivial hereditary property…

Combinatorics · Mathematics 2024-05-16 Alexander Clifton , Hong Liu , Letícia Mattos , Michael Zheng

Let $G=(V,E)$ be a graph. If $G$ is a K\"onig graph or $G$ is a graph without 3-cycles and 5-cycle, we prove that the following conditions are equivalent: $\Delta_{G}$ is pure shellable, $R/I_{\Delta}$ is Cohen-Macaulay, $G$ is unmixed…

Combinatorics · Mathematics 2015-05-04 Iván Dario Castrillón , Roberto Cruz , Enrique Reyes

A theorem of Grove and Searle directly establishes that positive curvature 2d manifolds M with effective circular symmetry group of dimension 8 or less have positive Euler characteristic X(M): the fixed point set N consists of even…

Differential Geometry · Mathematics 2020-06-23 Oliver Knill

The space of topological decompositions into triangulations of a surface has a natural graph structure where two triangulations share an edge if they are related by a so-called flip. This space is a sort of combinatorial Teichm\"uller space…

Geometric Topology · Mathematics 2014-11-18 Valentina Disarlo , Hugo Parlier

We show that a conformal connection on a closed oriented surface $\Sigma$ of negative Euler characteristic preserves precisely one conformal structure and is furthermore uniquely determined by its unparametrised geodesics. As a corollary it…

Differential Geometry · Mathematics 2015-08-19 Thomas Mettler

The curve graphs are not locally finite. In this paper, we show that the curve graphs satisfy a property which is equivalent to graphs being uniformly locally finite via Masur--Minsky's subsurface projections. As a direct application of…

Geometric Topology · Mathematics 2015-11-03 Yohsuke Watanabe

It is proved that vertical graphs and radial graphs are strongly stable for a certain type of densities in Euclidean space ${\mathbb R}^{n+1}$. Particular cases of these densities include translators, expanders and singular minimal…

Differential Geometry · Mathematics 2025-05-05 Rafael López