Related papers: Geodesic nets with three boundary vertices
We show that every cubic bridgeless graph with n vertices has at least 3n/4-10 perfect matchings. This is the first bound that differs by more than a constant from the maximal dimension of the perfect matching polytope.
We give a universal upper bound for the total curvature of minimizing geodesic on a convex surface in the Euclidean space.
We show that there exists a geodesic spanner with almost linear number of edges.
In this paper, our aim is to give surfaces in the Galilean 3-space G3 with the property that there exist four geodesics through each point such that every surface built with the normal lines and the binormal lines along these geodesics is a…
A graph on $n \ge 3$ vertices drawn in the plane such that each edge is crossed at most four times has at most $6(n-2)$ edges -- this result proven by Ackerman is outstanding in the literature of beyond-planar graphs with regard to its…
We show that the metric of nonpositively curved graph manifolds is determined by its geodesic flow. More precisely we show that if the geodesic flows of two nonpositively curved graph manifolds are $C^0$ conjugate then the spaces are…
A net is a special configuration of lines and points in the projective plane. There are certain restrictions on the number of its lines and points. We proved that there cannot be any (4,4) nets in $\mathbb{C}P^2$. In order to show this, we…
We prove that alternating links with two totally geodesic checkerboard surfaces are three links with projection the 1-skeleton of the octahedron, the cuboctahedron and the icosidodecahedron. We also characterize these links as right-angled…
Consider all geodesics between two given points on a polyhedron. On the regular tetrahedron, we describe all the geodesics from a vertex to a point, which could be another vertex. Using the Stern--Brocot tree to explore the recursive…
A triangulation of a surface is irreducible if no edge can be contracted to produce a triangulation of the same surface. In this paper, we investigate irreducible triangulations of surfaces with boundary. We prove that the number of…
A set S of vertices of a graph G is a geodesic transversal of G if every maximal geodesic of G contains at least one vertex of S. We determine a smallest geodesic transversal in certain interconnection networks such as mesh of trees, and…
We investigate vertices for plane curves with singular points. As plane curves with singular points, we consider Legendre curves (respectively, Legendre immersions) in the unit tangent bundle over the Euclidean plane and frontals…
Let S be a triangulated 2-sphere with fixed triangulation T. We apply the methods of thin position from knot theory to obtain a simple version of the three geodesics theorem for the 2-sphere [5]. In general these three geodesics may be…
For non-compact manifolds with boundary we prove that bounded geometry defined by coordinate-free curvature bounds is equivalent to bounded geometry defined using bounds on the metric tensor in geodesic coordinates. We produce a nice atlas…
Geodesic metric spaces support a variety of averaging constructions for given finite sets. Computing such averages has generated extensive interest in diverse disciplines. Here we consider the inverse problem of recognizing computationally…
We show that a matchstick graph with $n$ vertices has no more than $3n-c\sqrt{n-1/4}$ edges, where $c=\frac12(\sqrt{12} + \sqrt{2\pi\sqrt{3}})$. The main tools in the proof are the Euler formula, the isoperimetric inequality, and an upper…
A sequence of distinct closed surfaces in a hyperbolic 3-manifold M is asymptotically geodesic if their principal curvatures tend uniformly to zero. When M has finite volume, we show such sequences are always asymptotically dense in the…
We consider motion by anisotropic curvature of a network of three curves immersed in the plane meeting at a triple junction and with the other ends fixed. We show existence, uniqueness and regularity of a maximal geometric solution and we…
We consider the motion by curvature of a network of smooth curves with multiple junctions in the plane, that is, the geometric gradient flow associated to the length functional. Such a flow represents the evolution of a two--dimensional…
In this paper, we consider rational cuspidal plane curves having at least three cusps. We give an upper bound of the self-intersection number of the proper transforms of such curves via the minimal embedded resolution of the cusps. For a…