English
Related papers

Related papers: Every graph is a cut locus

200 papers

The visibility graph Vis(X) of a discrete point set X in the plane has vertex set X and an edge xy for every two points x,y\in X whenever there is no other point in X on the line segment between x and y. We show that for every graph G,…

Combinatorics · Mathematics 2007-05-23 F. Pfender

We consider a the minimum k-way cut problem for unweighted graphs with a size bound s on the number of cut edges allowed. Thus we seek to remove as few edges as possible so as to split a graph into k components, or report that this requires…

Discrete Mathematics · Computer Science 2011-01-27 Ken-ichi Kawarabayashi , Mikkel Thorup

We show that every continuous rotative mapping on a closed interval has a fixed point. This gives an answer to some open questions raised by Goebel and Koter.

Classical Analysis and ODEs · Mathematics 2014-06-02 Tammatada Pongsriiam , Imchit Termwuttipong

Topology and geometry are deeply intertwined in the study of surfaces, though their interaction manifests differently in smooth and discrete settings. In the smooth category, a classical result asserts that any closed smooth surface…

Differential Geometry · Mathematics 2025-12-23 Soto Hisakawa , Shizuo Kaji , Ryo Kawai

On one hand, we study the class of graphs on surfaces, satisfying tessellation properties, with positive Forman curvature on each edge. Via medial graphs, we provide a new proof for the finiteness of the class, and give a complete…

Combinatorics · Mathematics 2020-02-11 Yohji Akama , Bobo Hua , Yanhui Su , Haohang Zhang

It is proved that any one-to-one edge map f from a 3-connected graph G onto a graph H, G and H possibly infinite, satisfying f(C) is a circuit in H whenever C is a circuit in G is induced by a vertex isomorphism. This generalizes a result…

Combinatorics · Mathematics 2017-11-29 Jon Henry Sanders , David Sanders

Let $S$ be a complete flat surface, such as the Euclidean plane. We determine the homeomorphism class of the space of all curves on $S$ which start and end at given points in given directions and whose curvatures are constrained to lie in a…

Geometric Topology · Mathematics 2025-10-28 Nicolau C. Saldanha , Pedro Zühlke

We consider the Dirichlet Laplacian in unbounded strips on ruled surfaces in any space dimension. We locate the essential spectrum under the condition that the strip is asymptotically flat. If the Gauss curvature of the strip equals zero,…

Mathematical Physics · Physics 2022-08-22 David Krejcirik , Katerina Zahradova

A digraph is connected-homogeneous if any isomorphism between finite connected induced subdigraphs extends to an automorphism of the digraph. We consider locally-finite connected-homogeneous digraphs with more than one end. In the case that…

Combinatorics · Mathematics 2010-11-30 Robert Gray , Rognvaldur G. Moller

For any finite abelian group $G$ and any subset $S\seq G$, we determine the connectivity of the addition Cayley graph induced by $S$ on $G$. Moreover, we show that if this graph is not complete, then it possesses a minimum vertex cut of a…

Combinatorics · Mathematics 2007-10-08 David J. Grynkiewicz , Oriol Serra , Vsevolod Lev

It is well-known that a finite graph can be viewed, in many respects, as a discrete analogue of a Riemann surface. In this paper, we pursue this analogy further in the context of linear equivalence of divisors. In particular, we formulate…

Combinatorics · Mathematics 2007-07-09 Matthew Baker , Serguei Norine

We introduce a notion of curvature on finite, combinatorial graphs. It can be easily computed by solving a linear system of equations. We show that graphs with curvature bounded below by $K>0$ have diameter bounded by $\mbox{diam}(G) \leq…

Combinatorics · Mathematics 2022-09-07 Stefan Steinerberger

The manifold M being compact and connected, we prove that every submanifold of its cotangent bundle that is Hamiltonianly isotopic to the zero-section and that is invariant by a Tonelli flow is a graph.

Symplectic Geometry · Mathematics 2010-06-18 Marie-Claude Arnaud

In this article, we prove the stability with respect to the Hausdorff metric $d_H$ of the cut locus $\mathrm{Cut}(p, \mathfrak{g})$ of a point $p$ in a compact Riemannian manifold $(M, \mathfrak{g})$ under $C^2$ perturbation of the metric.…

Differential Geometry · Mathematics 2025-12-10 Aritra Bhowmick , Jin-ichi Itoh , Sachchidanand Prasad

We consider the graphical mean curvature flow of strictly area decreasing maps $f:M\to N$, where $M$ is a compact Riemannian manifold of dimension $m>1$ and $N$ a complete Riemannian surface of bounded geometry. We prove long-time existence…

Differential Geometry · Mathematics 2022-11-08 Renan Assimos , Andreas Savas-Halilaj , Knut Smoczyk

Greb\'ik and Rocha [Fractional Isomorphism of Graphons, Combinatorica 42, pp 365-404 (2022)] extended the well studied notion of fractional isomorphism of graphs to graphons. We prove that fractionally isomorphic graphons can be…

Combinatorics · Mathematics 2023-09-22 Jan Hladký , Eng Keat Hng

We investigate how to find generic and globally rigid realizations of graphs in $\mathbb{R}^d$ based on elementary geometric observations. Our arguments lead to new proofs of a combinatorial characterization of the global rigidity of graphs…

Combinatorics · Mathematics 2014-08-12 Shin-ichi Tanigawa

A Riemann-Roch theorem on graph was initiated by M. Baker and S. Norine. In their article [2], a Riemann-Roch theorem on a finite graph with uniform vertex-weight and uniform edge-weight was established and it was suggested a Riemann-Roch…

Combinatorics · Mathematics 2022-01-20 Atsushi Atsuji , Hiroshi Kaneko

On a compact manifold with boundary, the map consisting of the scalar curvature in the interior and the mean curvature on the boundary is a local surjection at generic metrics. We prove that this result may be localized to compact…

Differential Geometry · Mathematics 2025-12-02 Hongyi Sheng

A point visibility graph is a graph induced by a set of points in the plane, where every vertex corresponds to a point, and two vertices are adjacent whenever the two corresponding points are visible from each other, that is, the open…

Computational Geometry · Computer Science 2019-02-05 Jean Cardinal , Udo Hoffmann