Related papers: Every graph is a cut locus

We prove the mean curvature flow of a spacelike graph in $(\Sigma_1\times \Sigma_2, g_1-g_2)$ of a map $f:\Sigma_1\to \Sigma_2$ from a closed Riemannian manifold $(\Sigma_1,g_1)$ with $Ricci_1> 0$ to a complete Riemannian manifold…

We prove that there exists an absolute constant $C>0$ such that, for any positive integer $k$, every graph $G$ with minimum degree at least $Ck$ admits a vertex-partition $V(G)=S\cup T$, where both $G[S]$ and $G[T]$ have minimum degree at…

A graph is said to be globally rigid in $d$-dimensional space if almost all of its embeddings are unique up to isometries. If a graph has enough automorphisms to send any of its vertices into any other, then it is called vertex-transitive.…

Consider the Euclidean space $\mathbb{R}^3$ endowed with a canonical semi-symmetric non-metric connection determined by a vector field $\mathsf{C}\in\mathfrak{X}(\mathbb{R}^3)$. We study surfaces when the sectional curvature with respect to…

We study a Neumann problem related to the evolution of graphs under mean curvature flow in Riemannian manifolds endowed with a Killing vector field. We prove that in a particular case these graphs converge to a bounded minimal graph which…

We prove that the cut space of any transitive graph $G$ is a finitely generated ${\rm Aut}(G)$-module if the same is true for its cycle space. This confirms a conjecture of Diestel which says that every locally finite transitive graph whose…

We prove that a properly embedded annular end of a surface in $\mathbb H^2\times\mathbb R$ with constant mean curvature $0<H\leq \frac{1}{2}$ can not be contained in any horizontal slab. Moreover, we show that a properly embedded surface…

While the problem of determining whether an embedding of a graph $G$ in $\mathbb{R}^2$ is {\it infinitesimally rigid} is well understood, specifying whether a given embedding of $G$ is {\it rigid} or not is still a hard task that usually…

A stable cutset is a set of vertices $S$ of a connected graph, that is pairwise non-adjacent and when deleting $S$, the graph becomes disconnected. Determining the existence of a stable cutset in a graph is known to be NP-complete. In this…

We call a finite undirected graph minimally k-matchable if it has at least k distinct perfect matchings but deleting any edge results in a graph which has not. An odd subdivision of some graph G is any graph obtained by replacing every edge…

We obtain a Central Limit Theorem for closed Riemannian manifolds, clarifying along the way the geometric meaning of some of the hypotheses in Bhattacharya and Lin's Omnibus Central Limit Theorem for Fr\'echet means. We obtain our CLT…

We study the Seifert surfaces of a link by relating the embeddings of graphs by using induced graphs. As applications, we prove that every link $L$ is the boundary of an oriented surface which is obtained from a graph embedding of a…

Bounds are proved for the connective constant \mu\ of an infinite, connected, \Delta-regular graph G. The main result is that \mu\ \ge \sqrt{\Delta-1} if G is vertex-transitive and simple. This inequality is proved subject to weaker…

A graph $H$ is ubiquitous if for every graph $G$ that for every natural number $n$ contains $n$ vertex-disjoint $H$-minors contains infinitely many vertex-disjoint $H$-minors. Andreae conjectured that every locally finite graph is…

A disk graph is the intersection graph of disks in the plane, a unit disk graph is the intersection graph of same radius disks in the plane, and a segment graph is an intersection graph of line segments in the plane. It can be seen that…

We find conditions under which Almgren-Pitts min-max for the prescribed geodesic curvature functional in a closed oriented Riemannian surface produces a closed embedded curve of constant curvature. In particular, we find a closed embedded…

A surface in a Riemannian space is called of constant astigmatism if the difference between the principal radii of curvatures at each point is a constant function. In this paper we give a classification of all rotational surfaces of…

In this paper, we are interested in short homologically and homotopically independent loops based at the same point on Riemannian surfaces and metric graphs. First, we show that for every closed Riemannian surface of genus $g \geq 2$ and…

In this paper, we study the Hamiltonicity of graphs with large minimum degree. Firstly, we present some conditions for a simple graph to be Hamilton-connected and traceable from every vertex in terms of the spectral radius of the graph or…

The locality of a graph problem is the smallest distance $T$ such that each node can choose its own part of the solution based on its radius-$T$ neighborhood. In many settings, a graph problem can be solved efficiently with a distributed or…