Related papers: Spatial Graphs with Local Knots
A well-known theorem of Whitney states that a 3-connected planar graph admits an essentially unique embedding into the 2-sphere. We prove a 3-dimensional analogue: a simply-connected $2$-complex every link graph of which is 3-connected…
We prove a neighbourhood theorem for arbitrary knots in contact 3-manifolds. As an application we show that two topologically isotopic Legendrian knots in a contact 3-manifold become Legendrian isotopic after suitable stabilisations.
For any pair of edges $e,f$ of a graph $G$, we say that {\em $e,f$ are $P_3$-connected in $G$} if there exists a sequence of edges $e=e_0,e_1,\ldots, e_k=f$ such that $e_i$ and $e_{i+1}$ are two edges of an induced $3$-vertex path in $G$…
For each $n\leq 6$, we characterize all the groups which can occur as either the orientation preserving topological symmetry group or the topological symmetry group of some embedding of $K_n$ in $S^3$.
We consider the ways minimal sets of flows in $S^3$ may be embedded. We prove that given any $C^2$ flow on $S^3$ with positive entropy, there is an uncountable collection $\mathcal{M}$ of topologically distinct minimal sets such that for…
Let $K_n$ be a complete graph with $n$ vertices. An embedding of $K_n$ in $S^3$ is called a spatial $K_n$-graph. Knots in a spatial $K_n$-graph corresponding to simple cycles of $K_n$ are said to be constituent knots. We consider the case…
Local sets, a graph structure invariant under local complementation, have been originally introduced in the context of quantum computing for the study of quantum entanglement within the so-called graph state formalism. A local set in a…
We classify all groups which can occur as the topological symmetry group of some embedding of the Heawood graph in $S^3$.
This paper examines the relationship between the knotting of an embedded surface in $\R^3$ and the knotting of its fold curves, formed by the singular set of projection to a plane. The first result shows that every surface, no matter how…
The space of n-sided polygons embedded in three-space consists of a smooth manifold in which points correspond to piecewise linear or ``geometric'' knots, while paths correspond to isotopies which preserve the geometric structure of these…
A polynomial knot in $\mathbb{R}^n$ is a smooth embedding of $\mathbb{R}$ in $\mathbb{R}^n$ such that the component functions are real polynomials. In the earlier paper with Mishra, we have studied the space $\mathcal{P}$ of polynomial…
A zigzag in a map (a $2$-cell embedding of a connected graph in a connected closed $2$-dimensional surface) is a cyclic sequence of edges satisfying the following conditions: 1) any two consecutive edges lie on the same face and have a…
Planar locally finite graphs which are almost vertex transitive are discussed. If the graph is 3-connected and has at most one end then the group of automorphisms is a planar discontinuous group and its structure is well-known. A general…
In this work we show that any connected locally connected graph defines a metric space having at least as many lines as vertices with only three exception: the complete multipartite graphs $K_{1,2,2}$, $K_{2,2,2}$ and $K_{2,2,2,2}$. This…
Knots are deeply entangled with every branch of science. One of the biggest open challenges in knot theory is to formalise a knot invariant that can unambiguously and efficiently distinguish any two knotted curves. Additionally, the…
This paper is the last part of a comprehensive survey of a newly emerging field: a topological approach to the study of locally finite graphs that crucially incorporates their ends. Topological arcs and circles, which may pass through ends,…
Symmetric edge polytopes are lattice polytopes associated with finite simple graphs that are of interest in both theory and applications. We investigate the facet structure of symmetric edge polytopes for various models of random graphs.…
This paper is a self-contained development of an invariant of graphs embedded in three-dimensional Euclidean space using the Jones polynomial and skein theory. Some examples of the invariant are computed. An unlinked embedded graph is one…
We characterize which automorphisms of an arbitrary complete bipartite graph $K_{n,m}$ can be induced by a homeomorphism of some embedding of the graph in $S^3$.
Entangled embedded periodic nets and crystal frameworks are defined, along with their dimension type, homogeneity type, adjacency depth and periodic isotopy type. We obtain periodic isotopy classifications for various families of embedded…