Related papers: $h$-perfect plane triangulations
It is conjectured that every cusped hyperbolic 3-manifold admits a geometric triangulation, i.e. it is decomposed into positive volume ideal hyperbolic tetrahedra. Here, we show that sufficiently highly twisted knots admit a geometric…
We consider triangulations of closed surfaces S with a given set of vertices V; every triangulation can be branched that is enhanced to a Delta-complex. Branched triangulations are considered up to the b-transit equivalence generated by…
Let $M$ be a non-compact hyperbolic $3$-manifold with finite volume and totally geodesic boundary components. By subdividing mixed ideal polyhedral decompositions of $M$, under some certain topological conditions, we prove that $M$ has an…
Reed showed that, if two graphs are $P_4$-isomorphic, then either both are perfect or none of them is. In this note we will derive an analogous result for perfect digraphs.
It is shown that a simple graph which is embeddable in the real projective plane is minimally 3-rigid if and only if it is (3,6)-tight. Moreover the topologically uncontractible embedded graphs of this type are constructible from one of 8…
We investigate zigzags in triangulations of connected closed $2$-dimensional surfaces and show that there is a one-to-one correspondence between triangulations with homogeneous zigzags and closed $2$-cell embeddings of directed Eulerian…
A graph is $1$-$planar$ if it can be drawn in the plane so that each edge is crossed by at most one other edge. Moreover, a 1-planar graph $G$ is $optimal$ if it satisfies $|E(G)|=4|V(G)|-8$. J. Fujisawa et al. [16] first considered…
We show that deciding whether a given graph $G$ of size $m$ has a unique perfect matching as well as finding that matching, if it exists, can be done in time $O(m)$ if $G$ is either a cograph, or a split graph, or an interval graph, or…
A graph is $k$-planar if it can be drawn in the plane such that no edge is crossed more than $k$ times. While for $k=1$, optimal $1$-planar graphs, i.e., those with $n$ vertices and exactly $4n-8$ edges, have been completely characterized,…
The goal of this paper is to generalize the theory of triangularizing matrices to linear transformations of an arbitrary vector space, without placing any restrictions on the dimension of the space or on the base field. We define a…
Let $\mathbb{S}_h$ denote a sphere with $h$ holes. Given a triangulation $G$ of a surface $\mathbb{M}$, we consider the question of when $G$ contains a spanning subgraph $H$ such that $H$ is a triangulated $\mathbb{S}_h$. We give a new…
We determine the minimum degree sum of two adjacent vertices that ensures a perfect matching in a 3-graph without isolated vertex. More precisely, suppose that $H$ is a 3-uniform hypergraph whose order $n$ is sufficiently large and…
Almost $50$ years ago Erd\H{o}s and Purdy asked the following question: Given $n$ points in the plane, how many triangles can be approximate congruent to equilateral triangles? They pointed out that by dividing the points evenly into three…
A topological group $G$ is {\em sequentially $h$-complete} if all the continuous homomorphic images of $G$ are sequentially complete. In this paper we give necessary and sufficient conditions on a complete group for being compact, using the…
We give a complete proof of Thurston's celebrated hyperbolic Dehn filling theorem, following the ideal triangulation approach of Thurston and Neumann-Zagier. We avoid to assume that a genuine ideal triangulation always exists, using only a…
A drawing of a graph $G$ is radial if the vertices of $G$ are placed on concentric circles $C_1, \ldots, C_k$ with common center $c$, and edges are drawn radially: every edge intersects every circle centered at $c$ at most once. $G$ is…
We determine the minimum vertex degree that ensures a perfect matching in a 3-uniform hypergraph. More precisely, suppose that H is a sufficiently large 3-uniform hypergraph whose order n is divisible by 3. If the minimum vertex degree of H…
R. Nandakumar asked whether there is a tiling of the plane by pairwise incongruent triangles of equal area and equal perimeter. Recently a negative answer was given by Kupavskii, Pach and Tardos. Still one may ask for weaker versions of the…
A triangulation of a point configuration is regular if it can be given by a height function, that is every point gets lifted to a certain height and projecting the lower convex hull gives the triangulation. Checking regularity of a…
The dimensions of the graded quotients of the cohomology of a plane curve complement with respect to the Hodge filtration are described in terms of simple geometrical invariants. The case of curves with ordinary singularities is discussed…