Related papers: Every graph has an embedding in $S^3$ containing n…
Embedding graphs in continous spaces is a key factor in designing and developing algorithms for automatic information extraction to be applied in diverse tasks (e.g., learning, inferring, predicting). The reliability of graph embeddings…
A fundamental theorem in graph theory states that any 3-connected graph contains a subdivision of $K_4$. As a generalization, we ask for the minimum number of $K_4$-subdivisions that are contained in every $3$-connected graph on $n$…
We prove that a graph has an infinitesimally rigid placement in a non-Euclidean normed plane if and only if it contains a $(2,2)$-tight spanning subgraph. The method uses an inductive construction based on generalised Henneberg moves and…
We show the existence of an infinite collection of hyperbolic knots where each of which has in its exterior meridional essential planar surfaces of arbitrarily large number of boundary components, or, equivalently, that each of these knots…
We apply the conormal construction to a hyperbolic knot $K \subset S^3$, and study the sutured contact manifold $(V, \xi)$ obtained by taking the complement of a standard neighbourhood of the unit conormal $\La_K \subset (ST^*S^3,…
In this work we study the asymptotic traffic flow in Gromov's hyperbolic graphs. We prove that under certain mild hypotheses the traffic flow in a hyperbolic graph tends to pass through a finite set of highly congested nodes. These nodes…
A mapping $\alpha : V(G) \to V(H)$ from the vertex set of one graph $G$ to another graph $H$ is an isometric embedding if the shortest path distance between any two vertices in $G$ equals the distance between their images in $H$. Here, we…
In this paper we prove that random $d$--regular graphs with $d\geq 3$ have traffic congestion of the order $O(n\log_{d-1}^{3}(n))$ where $n$ is the number of nodes and geodesic routing is used. We also show that these graphs are not…
Let $D$ be a diagram of an alternating knot with unknotting number one. The branched double cover of $S^3$ branched over $D$ is an L-space obtained by half integral surgery on a knot $K_D$. We denote the set of all such knots $K_D$ by…
It is known that the fundamental group homomorphism $\pi_1(T^2) \to \pi_1(S^3\setminus K)$ induced by the inclusion of the boundary torus into the complement of a knot $K$ in $S^3$ is a complete knot invariant. Many classical invariants of…
Let $K$ be a tame knot embedded in $\mathbf{S}^3$. We address the problem of finding the minimal degree non-cyclic cover $p:X \rightarrow \mathbf{S}^3 \smallsetminus K$. When $K$ has non-trivial Alexander polynomial we construct finite…
We initiate the study of combinatorial algorithms for Triangle Detection in $H$-free graphs. The goal is to decide if a graph that forbids a fixed pattern $H$ as a subgraph contains a triangle, using only "combinatorial" methods that…
An immersion of a graph $H$ into a graph $G$ is a one-to-one mapping $f:V(H) \to V(G)$ and a collection of edge-disjoint paths in $G$, one for each edge of $H$, such that the path $P_{uv}$ corresponding to edge $uv$ has endpoints $f(u)$ and…
It is shown that every knot or link is the set of complex tangents of a 3-sphere smoothly embedded in the three-dimensional complex space. We show in fact that a one-dimensional submanifold of a closed orientable 3-manifold can be realised…
A simple topological graph T = (V(T), E(T)) is a drawing of a graph in the plane where every two edges have at most one common point (an endpoint or a crossing) and no three edges pass through a single crossing. Topological graphs G and H…
We introduce a taxonomy of interaction types and show that graphs are focal hypergraphs: every graph is canonically a focal hypergraph via its closed neighbourhood structure, and every graph dynamical model is a special case of the general…
A graph is "$H$-free" if it has no induced subgraph isomorphic to $H$. A conjecture of Conlon, Fox and Sudakov states that for every graph $H$, there exists $s>0$ such that in every $H$-free graph with $n>1$ vertices, either some vertex has…
In the graph node embedding problem, embedding spaces can vary significantly for different data types, leading to the need for different GNN model types. In this paper, we model the embedding update of a node feature as a Hamiltonian orbit…
We associate a graph ${\mathcal N}_{S}$ with a semigroup $S$ (called the upper non-nilpotent graph of $S$). The vertices of this graph are the elements of $S$ and two vertices are adjacent if they generate a semigroup that is not nilpotent…
A self-contained graph is an infinite graph which is isomorphic to one of its proper induced subgraphs. In this paper, these graphs are studied by presenting some examples and defining some of their sub-structures such as removable…