arXiv research

3D Schoenflies theorem for simply-connected 2-complexes.

The paper connects link symmetries to finite subgroups of O(3).

We investigate properties of spatial graphs on the standard torus. It is known that nontrivial embeddings of planar graphs in the torus contain a nontrivial knot or a nonsplit link due to [1],[2]. Building on this and using the chirality of torus knots and links [3],[4], we prove that nontrivial embeddings of simple 3-…

Study finds maximal linklessly embeddable graphs up to 11 vertices and their complements.

It is shown that for any locally knotted edge of a 3-connected graph in $S^3$, there is a ball that contains all of the local knots of that edge and is unique up to an isotopy setwise fixing the graph. This result is applied to the study of topological symmetry groups of graphs embedded in $S^3$.

We consider when automorphisms of a graph can be induced by homeomorphisms of embeddings of the graph in a $3$-manifold. In particular, we prove that every automorphism of a graph is induced by a homeomorphism of some embedding of the graph in a connected sum of one or more copies of $S^2\times S^1$, yet there exist au…

We show that the edges of every 3-connected planar graph except $K_4$ can be colored with two colors in such a way that the graph has no color preserving automorphisms. Also, we characterize all graphs which have the property that their edges can be $2$-colored so that no matter how the graph is embedded in any orienta…

We prove two results on the classification of trivial Legendrian embeddings $g: G \rightarrow (S^3,ξ_{std})$ of planar graphs. First, the oriented Legendrian ribbon $R_g$ and rotation invariant $\text{rot}_g$ are a complete set of invariants. Second, if $G$ is 3-connected or contains $K_4$ as a minor, then the unique t…

We characterise the embeddability of simply connected locally 3-connected 2-dimensional simplicial complexes in 3-space in a way analogous to Kuratowski's characterisation of graph planarity, by excluded minors. This answers questions of Lovász, Pardon and Wagner.

The paper classifies smooth structures on product manifolds of 3-connected 8-manifolds with spheres.

Call {\em i-hedrite} any 4-valent n-vertex plane graph, whose faces are 2-, 3- and 4-gons only and $p_2+p_3=i$. The edges of an i-hedrite, as of any Eulerian plane graph, are partitioned by its {\em central circuits}, i.e. those, which are obtained by starting with an edge and continuing at each vertex by the edge oppo…

The main result of this paper is that for every closed, connected, orientable, irreducible 3-manifold $M$, there is an integer $n_M$ such that any abstract graph with no automorphism of order 2 which has a 3-connected minor whose genus is more than $n_M$ has no achiral embedding in $M$. By contrast, the paper also pro…

Hamiltonian cycles found in toroidal maps.

A pseudo-edge graph of a convex polyhedron K is a 3-connected embedded graph in K whose vertices coincide with those of K, whose edges are distance minimizing geodesics, and whose faces are convex. We construct a convex polyhedron K in Euclidean 3-space with a pseudo-edge graph with respect to which K is not unfoldable…

A {\em blink} is a plane graph with a bipartition (black, gray) of its edges. Subtle classes of blinks are in 1-1 correspondence with closed, oriented and connected 3-manifolds up to orientation preserving homeomorphisms \cite{lins2013B}. Switching black and gray in a blink $B$, giving $-B$, reverses the manifold orien…

We prove Witten's formula relating the Donaldson and Seiberg-Witten series modulo powers of degree $c+2$, with $c=-{1/4}(7χ+11σ)$, for four-manifolds obeying some mild conditions, where $χ$ and $σ$ are their Euler characteristic and signature. We use the moduli space of SO(3) monopoles as a cobordism between a link of …

3028 obstructions found for embedding without knots.

This article is based on a lecture by the first author at the International Georgia Topology Conference 2001 (Athens, Georgia) and the Mathematische Arbeitstagung 2001 (Bonn, Germany). We sketch a proof of Witten's formula relating the Donaldson and Seiberg-Witten series modulo powers of degree c+2, with c = -{1/4}(7 c…

The study characterizes embeddable 2-complexes in 3-space.

We study the problem of finding good gauges for connections in higher gauge theories. We find that, for $2$-connections in strict $2$-gauge theory and $3$-connections in $3$-gauge theory, there are local "Coulomb gauges" that are more canonical than in classical gauge theory. In particular, they are essentially unique,…

There is a well-known way to describe a link diagram as a (signed) plane graph, called its Tait graph. This concept was recently extended, providing a way to associate a set of embedded graphs (or ribbon graphs) to a link diagram. While every plane graph arises as a Tait graph of a unique link diagram, not every embedd…

In the $3$-gauge theory, a $3$-connection is given by a $1$-form $A$ valued in the Lie algebra $\mathfrak g$, a $2$-form $B$ valued in the Lie algebra $\mathfrak h$ and a $3$-form $C$ valued in the Lie algebra $\mathfrak l$, where $(\mathfrak g,\mathfrak h, \mathfrak l)$ constitutes a differential $2$-crossed modu…

The present paper is an introduction to a combinatorial theory arising as a natural generalisation of classical and virtual knot theory. There is a way to encode links by a class of `realisable' graphs. When passing to generic graphs with the same equivalence relations we get `graph-links'. On one hand graph-links gene…

Survey of intrinsically linked or knotted graphs.

Classifies colored links and spatial graphs up to colored link-homotopy.

The present paper is a review of the current state of Graph-Link Theory (graph-links are also closely related to homotopy classes of looped interlacement graphs), dealing with a generalisation of knots obtained by translating the Reidemeister moves for links into the language of intersection graphs of chord diagrams. I…

The paper generalizes linking number properties for complete graphs.

NPGNN improves graph link prediction by adapting to new graphs.

New equivalence relation on ribbon graphs connects to virtual links.

GEN tackles few-shot out-of-graph link prediction in evolving multi-relational graphs.

Characterizes weakly linked pairs of complete graphs in 3D space.

We examine graphs that contain a non-trivial link in every embedding into real projective space, using a weaker notion of unlink than was used by Flapan, et al. We call such graphs intrinsically linked in projective space. We fully characterize such graphs with connectivity 0,1 and 2. We also show that only one Peterse…

Recently, Dasbach, Futer, Kalfagianni, Lin, and Stoltzfus extended the notion of a Tait graph by associating a set of ribbon graphs (or equivalently, embedded graphs) to a link diagram. Here we focus on Seifert graphs, which are the ribbon graphs of a knot or link diagram that arise from Seifert states. We provide a ch…

We study intrinsically linked graphs where we require that every embedding of the graph contains not just a non-split link, but a link that satisfies some additional property. Examples of properties we address in this paper are: a two component link with lk(A,L) = k2^r, k not 0, a non-split n-component link where all l…

Every link diagram can be represented as a signed ribbon graph. However, different link diagrams can be represented by the same ribbon graphs. We determine how checkerboard colourable diagrams of links in real projective space, and virtual link diagrams, that are represented by the same ribbon graphs are related to eac…

Simpler algorithms for morphing planar and toroidal graphs.

The paper explores linked cycles in graphs and their properties.

Study links and quivers, proving polynomial equality conjecture.

Graph Convolutional Gaussian Processes predict missing links.

Paper generalizes pretzel links using spatial graphs.

We say that a graph is intrinsically non-trivial if every spatial embedding of the graph contains a non-trivial spatial subgraph. We prove that an intrinsically non-trivial graph is intrinsically linked, namely every spatial embedding of the graph contains a non-splittable 2-component link. We also show that there exis…

It is well known that surface-links in 4-space can be presented by diagrams on the plane of 4-valent spatial graphs with makers on the vertices, called marked graph diagrams. In this paper we extend the method of presenting surface-links by marked graph diagrams to presenting immersed surface-links. We also give some m…

We define an equivalence relation on graphs with signed edges, such that the associated adjacency matrices of two equivalent graphs are congruent over $\mathbb{Z}$. We show that signed graphs whose eigenvalues are larger than $-2$ are equivalent to one of the simply laced Dynkin diagrams: $A_{n}$, $D_{n}$, $E_{6}$, $E_…

We introduce and study so-called self-indexed graphs. These are (oriented) finite graphs endowed with a map from the set of edges to the set of vertices. Such graphs naturally arise from classical knot and link diagrams. In fact, the graphs resulting from link diagrams have an additional structure, an integral flow. We…

In this paper we review the definitions of homogeneous and alternative links. We also give two new characterizations of an alternative link diagram, one within the context of the enhanced checkerboard graph and another from the labeled Seifert graph.

We introduce new sufficient conditions for intrinsic knotting and linking. A graph on n vertices with at least 4n-9 edges is intrinsically linked. A graph on n vertices with at least 5n-14 edges is intrinsically knotted. We also classify graphs that are 0, 1, or 2 edges short of being complete partite graphs with respe…

Complete classification of links and spatial graphs with finite N-quandles.

Study shows gMPNNs struggle with OOD link prediction in larger test graphs.