Related papers: Solving a conjecture about tessellation graphs of …
Recent literature on Weil-Petersson random hyperbolic surfaces has met a consistent obstacle: the necessity to condition the model, prohibiting certain rare geometric patterns (which we call tangles), such as short closed geodesics or…
A graph G is a (Euclidean) unit disk graph if it is the intersection graph of unit disks in the Euclidean plane $\mathbb{R}^2$. Recognizing them is known to be $\exists\mathbb{R}$-complete, i.e., as hard as solving a system of polynomial…
We show that the perimeter of the convex hull of finitely many disks lying in the hyperbolic or Euclidean plane, or in a hemisphere does not increase when the disks are rearranged so that the distances between their centers do not increase.…
A decoration of a hyperbolic surface of finite type is a choice of circle, horocycle or hypercycle about each cone-point, cusp or flare of the surface, respectively. In this article we show that a decoration induces a unique canonical…
This survey reviews hyperbolic graph embedding models, and evaluate them on anomaly detection, highlighting their advantages over Euclidean methods in capturing complex structures. Evaluating models like \textit{HGCAE},…
Several articles deal with tilings with squares and dominoes of the well-known regular square mosaic in Euclidean plane, but not any with the hyperbolic regular square mosaics. In this article, we examine the tiling problem with colored…
Recent papers in the graph machine learning literature have introduced a number of approaches for hyperbolic representation learning. The asserted benefits are improved performance on a variety of graph tasks, node classification and link…
This paper is motivated by the following question: what are the unavoidable induced subgraphs of graphs with large treewidth? Aboulker et al. made a conjecture which answers this question in graphs of bounded maximum degree, asserting that…
Using concepts and techniques of bilinear algebra, we construct hyperbolic planes over a euclidean ordered field that satisfy all the Hilbert axioms of incidence, order and congruence for a basic plane geometry, but for which the hyperbolic…
We study whether a given graph can be realized as an adjacency graph of the polygonal cells of a polyhedral surface in $\mathbb{R}^3$. We show that every graph is realizable as a polyhedral surface with arbitrary polygonal cells, and that…
Equistable graphs are graphs admitting positive weights on vertices such that a subset of vertices is a maximal stable set if and only if it is of total weight $1$. In $1994$, Mahadev et al.~introduced a subclass of equistable graphs,…
We show that Caratheodory's conjecture, on umbilical points of closed convex surfaces, may be reformulated in terms of the existence of at least one umbilic in the graphs of functions f: R^2-->R whose gradient decays uniformly faster than…
A "folklore conjecture, probably due to Tutte" (as described in [P.D. Seymour, Sums of circuits, Graph theory and related topics (Proc. Conf., Univ. Waterloo, 1977), pp. 341-355, Academic Press, 1979]) asserts that every bridgeless cubic…
There is empirical evidence supporting the claim that almost all cubic non-Hamiltonian graphs are bridge graphs. In this paper, we pose a related conjecture and prove that the original claim holds for non-3-connected graphs if the…
After having investigated the real conic sections and their isoptic curves in the hyperbolic plane $\bH^2$ we consider the problem of the isoptic curves of generalized conic sections in the extended hyperbolic plane. This topic is widely…
We prove that the isoperimetric inequalities in the euclidean and hyperbolic plane hold for all euclidean, respectively hyperbolic, cone-metrics on a disk with singularities of negative curvature. This is a discrete analog of the theorems…
We prove that any graph of multicurves satisfying certain natural properties is either hyperbolic, relatively hyperbolic, or thick. Further, this geometric characterization is determined by the set of subsurfaces that intersect every vertex…
It is proved that vertical graphs and radial graphs are strongly stable for a certain type of densities in Euclidean space ${\mathbb R}^{n+1}$. Particular cases of these densities include translators, expanders and singular minimal…
Given a hyperbolic surface, the set of all closed geodesics whose length is minimal form a graph on the surface, in fact a so-called fat graph, which we call the systolic graph. We study which fat graphs are systolic graphs for some surface…
We show an efficient algorithm for generating geodesic regular tree structures for periodic hyperbolic and Euclidean tessellations and experimentally verify its performance on tessellations.