English
Related papers

Related papers: Every graph is a cut locus

200 papers

Assume that $A$ is a closed linear operator defined on all of a Hilbert space $H$. Then $A$ is bounded. A new short proof of this classical theorem is given on the basis of the uniform boundedness principle. The proof can be easily extended…

Functional Analysis · Mathematics 2016-01-13 A. G. Ramm

Associated to every closed, embedded submanifold $N$ of a connected Riemannian manifold $M$, there is the distance function $d_N$ which measures the distance of a point in $M$ from $N$. We analyze the square of this function and show that…

Differential Geometry · Mathematics 2023-03-28 Sachchidanand Prasad

We construct a parabolic entire minimal graph $S$ over a finite topology complete Riemannian surface $\Sigma$ of curvature $-1$ and infinite area (thus of non-parabolic conformal type). The vertical projection of this graph yields a…

Differential Geometry · Mathematics 2016-07-19 Laurent Mazet , Magdalena Rodriguez , Harold Rosenberg

We prove the existence and uniqueness of graphs with prescribed mean curvature function in a large class of Riemannian manifolds which comprises spaces endowed with a conformal Killing vector field.

Differential Geometry · Mathematics 2009-04-08 Marcos Dajczer , Jorge H. S. de Lira

Let G be a connected graph. The toughness of G is defined as t(G)=min{\frac{|S|}{c(G-S)}}, in which the minimum is taken over all proper subsets S\subset V(G) such that c(G-S)\geq 2 where c(G-S) denotes the number of components of G-S.…

Combinatorics · Mathematics 2023-09-12 Dandan Fan , Xiaofeng Gu , Huiqiu Lin

Contraction of an edge merges its end points into a new vertex which is adjacent to each neighbor of the end points of the edge. An edge in a $k$-connected graph is {\em contractible} if its contraction does not result in a graph of lower…

Discrete Mathematics · Computer Science 2009-02-10 N. S. Narayanaswamy , N. Sadagopan , Apoorve Dubey

Let $N$ be a complete manifold with bounded geometry, such that $\sec_N\le -\sigma < 0$ for some positive constant $\sigma$. We investigate the mean curvature flow of the graphs of smooth length-decreasing maps $f:\mathbb{R}^m\to N$. In…

Differential Geometry · Mathematics 2018-06-01 Felix Lubbe

In this paper, we consider the Ricci curvature of a directed graph, based on Lin-Lu-Yau's definition. We give some properties of the Ricci curvature, including conditions for a directed regular graph to be Ricci-flat. Moreover, we calculate…

Combinatorics · Mathematics 2018-08-24 Taiki Yamada

Flip graphs of non-crossing configurations in the plane are widely studied objects, e.g., flip graph of triangulations, spanning trees, Hamiltonian cycles, and perfect matchings. Typically, it is an easy exercise to prove connectivity of a…

Computational Geometry · Computer Science 2024-07-08 Linda Kleist , Peter Kramer , Christian Rieck

We investigate a graph-theoretic problem motivated by questions in quantum computing concerning the propagation of information in quantum circuits. A graph $G$ is said to be a bounded extension of its subgraph $L$ if they share the same…

Quantum Physics · Physics 2025-12-03 Fredy Yip

Generalizing Milnor's result that an FTC (finite total curvature) knot has an isotopic inscribed polygon, we show that any two nearby knotted FTC graphs are isotopic by a small isotopy. We also show how to obtain sharper constants when the…

Geometric Topology · Mathematics 2007-10-24 Elizabeth Denne , John M Sullivan

The Straightness is a measure designed to characterize a pair of vertices in a spatial graph. It is defined as the ratio of the Euclidean distance to the graph distance between these vertices. It is often used as an average, for instance to…

Discrete Mathematics · Computer Science 2023-05-12 Vincent Labatut

We characterise the form of all simple, finite graphs for which the girth of the graph is equal to the circumference of the graph. We apply this to prove a bound on the number of edges in such a graph.

Combinatorics · Mathematics 2022-10-11 Lewis Stanton , Jeffrey Thompson

In this paper we show that a nonlocal minimal surface which is a graph outside a cylinder is in fact a graph in the whole of the space. As a consequence, in dimension~$3$, we show that the graph is smooth. The proofs rely on convolution…

Analysis of PDEs · Mathematics 2016-06-14 Serena Dipierro , Ovidiu Savin , Enrico Valdinoci

We prove some rigidity and classification results for graphs with prescribed mean curvature and locally constant Dirichlet and Neumann data, for instance as they appear in capillarity problems. We consider domains in Riemannian manifolds,…

Differential Geometry · Mathematics 2025-12-22 Giulio Colombo , Alberto Farina , Marco Magliaro , Luciano Mari , Marco Rigoli

We establish the existence of hypersurfaces with constant mean curvature and a prescribed boundary in Euclidean space, represented as radial graphs over domains of the unit sphere. Under the assumptions that the mean curvature of the…

Differential Geometry · Mathematics 2025-07-25 Flávio Cruz , José T. Cruz , Jocel Oliveira

We study a modified notion of Ollivier's coarse Ricci curvature on graphs introduced by Lin, Lu, and Yau in [11]. We establish a rigidity theorem for complete graphs that shows a connected finite simple graph is complete if and only if the…

Combinatorics · Mathematics 2020-11-25 Vincent Bonini , Conor Carroll , Uyen Dinh , Sydney Dye , Joshua Frederick , Erin Pearse

We consider the motion by mean curvature of an $n$-dimensional graph over a time-dependent domain in $\mathbb{R}^n$, intersecting $\mathbb{R}^n$ at a constant angle. In the general case, we prove local existence for the corresponding…

Analysis of PDEs · Mathematics 2008-12-10 Alexandre Freire

We investigate the problem of the realization of a given graph as the Reeb graph $\mathcal{R}(f)$ of a smooth function $f\colon M\rightarrow \mathbb{R}$ with finitely many critical points, where $M$ is a closed manifold. We show that for…

Geometric Topology · Mathematics 2019-01-16 Łukasz Patryk Michalak

Let $S$ be a set of $n$ sites in the plane, so that every site $s \in S$ has an associated radius $r_s > 0$. Let $\mathcal{D}(S)$ be the disk intersection graph defined by $S$, i.e., the graph with vertex set $S$ and an edge between two…

Computational Geometry · Computer Science 2024-05-02 Alexander Baumann , Haim Kaplan , Katharina Klost , Kristin Knorr , Wolfgang Mulzer , Liam Roditty , Paul Seiferth
‹ Prev 1 3 4 5 6 7 10 Next ›