相关论文: Intrinsic linking and knotting are arbitrarily com…

Let $M$ be a connected, closed, oriented three-manifold and $K$, $L$ two rationally null-homologous oriented simple closed curves in $M$. We give an explicit algorithm for computing the linking number between $K$ and $L$ in terms of a…

Flapan--Naimi--Pommersheim showed that every spatial embedding of $K_{10}$, the complete graph on ten vertices, contains a non-split three-component link; that is, $K_{10}$ is intrinsically triple-linked in $\mathbb{R}^3$. The work of…

Tittmann, Averbouch and Makowsky [P. Tittmann, I. Averbouch, J.A. Makowsky, The enumeration of vertex induced subgraphs with respect to the number of components, European Journal of Combinatorics, 32 (2011) 954-974], introduced the subgraph…

We prove that the colored HOMFLY polynomial of a link, colored by symmetric or exterior powers of the fundamental representation, is q-holonomic with respect to the color parameters. As a result, we obtain the existence of an (a,q)…

It is well known that every sufficiently large connected graph has, as an induced subgraph, $K_n$, $K_{1,n}$, or an $n$-vertex path. A 2023 paper of Allred, Ding, and Oporowski identified a set of unavoidable induced subgraphs of…

For a graph G embedded in an orientable surface \Sigma, we consider associated links L(G) in the thickened surface \Sigma \times I. We relate the HOMFLY polynomial of L(G) to the recently defined Bollobas-Riordan polynomial of a ribbon…

The interior polynomial is an invariant of bipartite graphs, and a part of the HOMFLY polynomial of a special alternating link coincides with the interior polynomial of the Seifert graph of the link. We extend the interior polynomial to…

We initiate the study of classical knots through the homotopy class of the n-th evaluation map of the knot, which is the induced map on the compactified n-point configuration space. Sending a knot to its n-th evaluation map realizes the…

Semiholomorphic polynomials are functions $f:\mathbb{C}^2\to\mathbb{C}$ that can be written as polynomials in complex variables $u$, $v$ and the complex conjugate $\overline{v}$. We prove the semiholomorphic analogoue of Akbulut's and…

We prove that every internally 4-connected non-planar bipartite graph has an odd K_3,3 subdivision; that is, a subgraph obtained from K_3,3 by replacing its edges by internally disjoint odd paths with the same ends. The proof gives rise to…

We prove a 1985 conjecture of Gy\'arf\'as that for all $k,\ell$, every graph with sufficiently large chromatic number contains either a complete subgraph with $k$ vertices or an induced cycle of length at least $\ell$.

Given a link L in the 3-sphere, we ask whether the components of L bound disjoint, nullhomologous disks properly embedded in a simply-connected positive-definite smooth 4-manifold; the knot case has been studied extensively in work of…

This paper is the last paper in a series of five papers. Building on earlier papers in this series, we prove an analogue of Kuratowski's characterisation of graph planarity for three dimensions. More precisely, a simply connected…

While the problem of determining whether an embedding of a graph $G$ in $\mathbb{R}^2$ is {\it infinitesimally rigid} is well understood, specifying whether a given embedding of $G$ is {\it rigid} or not is still a hard task that usually…

The fundamental quandle is a complete invariant for unoriented tame knots \cite{JO, Ma} and non-split links \cite{FR}. The proof involves proving a relationship between the components of the fundamental quandle and the cosets of the…

Hadwiger's conjecture for the immersion relation posits that every graph $G$ contains an immersion of the complete graph $K_{\chi(G)}$. Vergara showed that this is equivalent to saying that every $n$-vertex graph $G$ with $\alpha(G)=2$…

A book embedding of a complete graph is a spatial embedding whose planar projection has the vertices located along a circle, consecutive vertices are connected by arcs of the circle, and the projections of the remaining "interior" edges in…

A circuit double cover of a bridgeless graph is a collection of even subgraphs such that every edge is contained in exactly two subgraphs of the given collection. Such a circuit double cover describes an embedding of the corresponding graph…

We show that there are links whose individual components are concordant to the unknot, but which are not concordant to any link with unknotted components. We give examples in the topological category, and examples in the smooth category…

A non-singular connected algebraic curve $A$ in a simply connected algebraic surface $X$ can be knotted so that its homology class and the fundamental group of its complement in $X$ is preserved, provided $A$ is sufficiently complex (not…