Related papers: Solving a conjecture about tessellation graphs of …
A graph $G=(V,E)$ is $\delta$-hyperbolic if for any four vertices $u,v,w,x$, the two larger of the three distance sums $d(u,v)+d(w,x)$, $d(u,w)+d(v,x)$, and $d(u,x)+d(v,w)$ differ by at most $2\delta \geq 0$. Recent work shows that many…
We prove infinitely many cases of conjectured sharp upper and lower bounds for the spanning tree entropy of any planar lattice graph. These bounds come from volumes of associated hyperbolic alternating links, right-angled hyperbolic…
In this paper we prove the conjecture posed by Kl\'en et al. in \cite{kvz}, and give optimal inequalities for generalized trigonometric and hyperbolic functions.
In this note we establish the existence of a new type of rigidity of symplectic embeddings coming from obligatory intersections with symplectic planes. More precisely, we prove that if a Euclidean ball is symplectically embedded in the…
A graph drawing is $\textit{greedy}$ if, for every ordered pair of vertices $(x,y)$, there is a path from $x$ to $y$ such that the Euclidean distance to $y$ decreases monotonically at every vertex of the path. Greedy drawings support a…
Listed as No. 53 among the one hundred famous unsolved problems in [J. A. Bondy, U. S. R. Murty, Graph Theory, Springer, Berlin, 2008] is Steinberg's conjecture, which states that every planar graph without 4- and 5-cycles is 3-colorable.…
A tessellation of the plane is face-homogeneous if for some integer $k\geq3$ there exists a cyclic sequence $\sigma=[p_0,p_1,\ldots,p_{k-1}]$ of integers $\geq3$ such that, for every face $f$ of the tessellation, the valences of the…
A conjecture by Rafla from 1988 asserts that every simple drawing of the complete graph $K_n$ admits a plane Hamiltonian cycle. It turned out that already the existence of much simpler non-crossing substructures in such drawings is hard to…
We prove that any $C^2$ complete, orientable, connected, stable area-stationary surface in the sub-Riemannian Heisenberg group $\mathbb{H}^1$ is either a Euclidean plane or congruent to the hyperbolic paraboloid $t=xy$.
We discuss generalizations of the well-known theorem of Hilbert that there is no complete isometric immersion of the hyperbolic plane into Euclidean 3-space. We show that this problem is expressed very naturally as the question of the…
We investigate the structure of isometric subgraphs of hypercubes (i.e., partial cubes) which do not contain finite convex subgraphs contractible to the 3-cube minus one vertex $Q^-_3$ (here contraction means contracting the edges…
The class of Euclidean unit disk graphs is one of the most fundamental and well-studied graph classes with underlying geometry. In this paper, we identify this class as a special case in the broader class of hyperbolic unit disk graphs and…
Let $\Omega\subset \mathbb{R}^d$ be a set of finite measure. The periodic tiling conjecture suggests that if $\Omega$ tiles $\mathbb{R}^d$ by translations then it admits at least one periodic tiling. Fuglede's conjecture suggests that…
Algebraic hyperbolicity serves as a bridge between differential geometry and algebraic geometry. Generally, it is difficult to show that a given projective variety is algebraically hyperbolic. However, it was established recently that a…
We study the inverse curve shortening flow in the hyperbolic plane $\h^2$. We classify all solitons with respect to parabolic and conformal vector fields of $\h^2$. In the upper half-plane model of $\h^2$, we prove that parabolic solitons…
Hyperbolic neural networks can effectively capture the inherent hierarchy of graph datasets, and consequently a powerful choice of GNNs. However, they entangle multiple incongruent (gyro-)vector spaces within a layer, which makes them…
This article introduces the notion of L-tangle-free compact hyperbolic surfaces, inspired by the identically named property for regular graphs. Random surfaces of genus g, picked with the Weil-Petersson probability measure, are (a log…
A graph $H$ is said to be positive if the homomorphism density $t_H(G)$ is non-negative for all weighted graphs $G$. The positive graph conjecture proposes a characterisation of such graphs, saying that a graph is positive if and only if it…
We prove that, for $C^1$-generic diffeomorphisms, if a homoclinic class is not hyperbolic, then there is a non-hyperbolic ergodic measure supported on it. This proves a conjecture by D\'iaz and Gorodetski [28]. We also discuss the…
We investigate the question of which graphs have planar emulators (a locally-surjective homomorphism from some finite planar graph) -- a problem raised already in Fellows' thesis (1985) and conceptually related to the better known planar…