Related papers: Modular flip-graphs of one holed surfaces
We obtain new lower and upper bounds for the maximum multiplicity of some weighted and, respectively, non-weighted common geometric graphs drawn on n points in the plane in general position (with no three points collinear): perfect…
Flip-graph connectedness is established here for the vertex set of the 4-dimensional cube. It is found as a consequence that this vertex set has 92 487 256 triangulations, partitioned into 247 451 symmetry classes.
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…
This article consists in applications of [arXiv:2511.14232] in the case of homemomorphisms of higher genus surfaces whose homological rotation set is big enough -- a class of dynamics that is open. We first prove a structure theorem for the…
Let $\mathbf{\Sigma}=(\Sigma,M,O)$ be a surface with marked points and order-2 orbifold points which is either unpunctured or once-punctured closed, and $\omega:O\rightarrow\{1,4\}$ a function. For each triangulation $\tau$ of…
Consider a graph drawn on a surface (for example, the plane minus a finite set of obstacle points), possibly with crossings. We provide an algorithm to decide whether such a drawing can be untangled, namely, if one can slide the vertices…
Topological triangulations of orientable and non-orientable surfaces with arbitrary genus have important applications in quantum geometry, graph theory and statistical physics. However, until now only the asymptotics for 2-spheres are known…
Given a graph $G$, a Berge copy of $G$ is a hypergraph obtained by enlarging the edges arbitrarily. Gy\H ori in 2006 showed that for $r=3$ or $r=4$, an $r$-uniform $n$-vertex Berge triangle-free hypergraph has at most $\lfloor…
Let $P$ be a collection of $n$ points moving along pseudo-algebraic trajectories in the plane. One of the hardest open problems in combinatorial and computational geometry is to obtain a nearly quadratic upper bound, or at least a subcubic…
The hull perimeter at distance d in a planar map with two marked vertices at distance k from each other is the length of the closed curve separating these two vertices and lying at distance d from the first one (d<k). We study the…
In this paper, the extremal graph with the maximum RRD-value among all the graphs of order n with given cut vertices or edges is characterized. In addition, an upper bounds on the reciprocal degree distance in terms of the number of cut…
In this paper we study a random graph with $N$ nodes, where node $j$ has degree $D_j$ and $\{D_j\}_{j=1}^N$ are i.i.d. with $\prob(D_j\leq x)=F(x)$. We assume that $1-F(x)\leq c x^{-\tau+1}$ for some $\tau>3$ and some constant $c>0$. This…
We prove that every locally Hamiltonian graph with $n\ge 3$ vertices and possibly with multiple edges has at least $3n-6$ edges with equality if and only if it triangulates the sphere. As a consequence, every edge-maximal embedding of a…
Given a set $\cal P$ of points in the Euclidean plane and two triangulations of $\cal P$, the flip distance between these two triangulations is the minimum number of flips required to transform one triangulation into the other.…
In an evolutionary system in which the rules of mutation are local in nature, the number of possible outcomes after $m$ mutations is an exponential function of $m$ but with a rate that depends only on the set of rules and not the size of…
Triangle strips have been widely used for efficient rendering. It is NP-complete to test whether a given triangulated model can be represented as a single triangle strip, so many heuristics have been proposed to partition models into few…
In this paper, the scaling limit of random connected cubic planar graphs (respectively multigraphs) is shown to be the Brownian sphere. The proof consists in essentially two main steps. First, thanks to the known decomposition of cubic…
We consider the problem of finding an inductive construction, based on vertex splitting, of triangulated spheres with a fixed number of additional edges (braces). We show that for any positive integer $b$ there is such an inductive…
We investigate the toroidal expanse of an embedded graph G, that is, the size of the largest toroidal grid contained in G as a minor. In the course of this work we introduce a new embedding density parameter, the stretch of an embedded…
A $triangulation$ is an embedding of a graph on surfaces where every face has length three. In this article, we show the existence of contractible Hamiltonian cycle in triangulated maps of which minimum degree is four.