Related papers: Interplay of Cubic Graphs and Simplicial Surfaces
We define an invariant, which we call surface-complexity, of closed 3-manifolds by means of Dehn surfaces. The surface-complexity of a manifold is a natural number measuring how much the manifold is complicated. We prove that it fulfils…
It is well-known that every 3-connected planar graph has a unique planar embedding on the sphere. We study the extension to triangulated 1-planar graphs, T1P graphs for short, which admit an embedding in which each edge is crossed at most…
In this note, using some regular triangular tilings of the sphere, the Euclidean plane and the hyperbolic plane, we examine the potential relationship between their discrete Bakry - Emery curvatures and the smooth curvatures of their…
We prove that a cubic graph with $m$ edges has an induced matching with at least $m/9$ edges. Our result generalizes a result for planar graphs due to Kang, Mnich, and M\"{u}ller (Induced matchings in subcubic planar graphs, SIAM J.…
For a given branched covering between closed connected surfaces, there are several easy relations one can establish between the Euler characteristics of the surfaces, their orientability, the total degree, and the local degrees at the…
We shall introduce the singular curvature function on cuspidal edges of surfaces, which is related to the Gauss-Bonnet formula and which characterizes the shape of cuspidal edges. Moreover, it is closely related to the behavior of the…
The edges surrounding a face of a map $M$ form a cycle $C$, called the boundary cycle of the face, and $C$ is often not a simple cycle. If the map $M$ is arc-transitive, then there is a cyclic subgroup of automorphisms of $M$ which leaves…
We show that to every maximal surface with conelike singularities in Lorentz-Minkowski space $\mathbb{L}^3$ that can be locally represented as the graph of a smooth function, there exists a corresponding timelike minimal surface in…
The characterization of bipartite distance-regularized graphs, where some vertices have eccentricity less than four, in terms of the incidence structures of which they are incidence graphs, is known. In this paper we prove that there is a…
We investigate the behaviour of vertices and inflexions on 1-parameter families of curves on smooth surfaces in the 3-space, which include a singular member. In particular, we discuss the context where the curves evolve as sections of a…
We characterise the quartic (i.e. 4-regular) multigraphs with the property that every edge lies in a triangle. The main result is that such graphs are either squares of cycles, line multigraphs of cubic multigraphs, or are obtained from…
We study the problem of finding the minimal (maximal) genus for a surface where a given four-valent graph with fixed opposite edge structure can be embedded into. We find several partial relations and give new reformulations in…
Generalizing pseudospherical drawings, we introduce a new class of simple drawings, which we call separable drawings. In a separable drawing, every edge can be closed to a simple curve that intersects each other edge at most once. Curves of…
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.
We define an invariant, which we call surface-complexity, of compact 3-manifolds by means of Dehn surfaces. The surface-complexity is a natural number measuring how much the manifold is complicated. We prove that it fulfils interesting…
A planar graph is inscribable if it is combinatorial equivalent to the skeleton of a polyhedra which is inscribed in a sphere. For an inscribable graph, in its combinatorial equivalent class, if we could always find polyhedra inscribed in…
A graph drawing in the plane is called an almost embedding if images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. We introduce integer invariants of almost embeddings: winding number, cyclic and triodic Wu…
The persistence diagram (PD) is an increasingly popular topological descriptor. By encoding the size and prominence of topological features at varying scales, the PD provides important geometric and topological information about a space.…
A conformal map from a Riemann surface to a Euclidean space of dimension greater than or equal to three is explained by using the Clifford algebra, in a similar fashion to quaternionic holomorphic geometry of surfaces in the Euclidean…
We study a wide spectrum of incidence problems involving points and curves or points and surfaces in $\mathbb R^3$. The current (and in fact the only viable) approach to such problems, pioneered by Guth and Katz [2010,2015], requires a…