Related papers: Structure and enumeration of K4-minor-free links a…

For every graph $X$, we consider the class of all connected $\{K_{1,3}, X\}$-free graphs which are distinct from an odd cycle and have independence number at least $4$, and we show that all graphs in the class are perfect if and only if $X$…

From the link Floer complex of a link $K$, we extract a lower bound $t_q'(K)$ for the rational unknotting number of $K$ (i.e. the minimum number of rational replacements required to unknot $K$). Moreover, we show that the torsion…

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…

Mader conjectured that for any tree $T$ of order $m$, every $k$-connected graph $G$ with minimum degree at least $\lfloor\frac{3k}{2}\rfloor +m-1$ contains a subtree $T'\cong T$ such that $G-V(T')$ is $k$-connected. In this paper, we give a…

We show that $|MS(L_1 # L_2)|=|MS(L_1)|\times|MS(L_2)|\times\mathbb{R}$ when $L_1$ and $L_2$ are any non-split and non-fibred links. Here $MS(L)$ denotes the Kakimizu complex of a link $L$, which records the taut Seifert surfaces for $L$.…

In this paper we introduce and study the theories of pseudo links and singular links in the Solid Torus, ST. Pseudo links are links with some missing crossing information that naturally generalize the notion of knot diagrams, and that have…

The prime motivation behind this paper is to prove that any torus link can be realized as the union of the one-dimensional connected components of the set of critical values of the argument map restricted to a complex algebraic plane curve.…

For a family $\mathcal{H}$ of graphs, a graph $G$ is said to be {\it $\mathcal{H}$-free} if $G$ contains no member of $\mathcal{H}$ as an induced subgraph. We let $\tilde{\mathcal{G}}_{3}(\mathcal{H})$ denote the family of connected…

For a simple drawing $D$ of the complete graph $K_n$, two (plane) subdrawings are compatible if their union is plane. Let $\mathcal{T}_D$ be the set of all plane spanning trees on $D$ and $\mathcal{F}(\mathcal{T}_D)$ be the compatibility…

We prove that the complement of any non-separating planar graph of order $2n-3$ contains a $K_n$ minor, and argue that the order $2n-3$ is lowest possible with this property. To illustrate the necessity of the non-separating hypothesis, we…

It is known that the unknotting number $u(L)$ of a link $L$ is less than or equal to half the crossing number $c(L)$ of $L$. We show that there are a planar graph $G$ and its spatial embedding $f$ such that the unknotting number $u(f)$ of…

We construct a graph G such that any embedding of G into R^{3} contains a nonsplit link of two components, where at least one of the components is a nontrivial knot. Further, for any m < n we produce a graph H so that every embedding of H…

The connected sum of two flat virtual knots depends on the choice of diagrams and basepoints. We show that any minimal crossing diagram of a composite flat virtual knot is a connected sum diagram. We also show the crossing number of flat…

Let $G=(V,E)$ be a connected graph. A subset $S\subset V$ is a cut of $G$ if $G-S$ is disconnected. A near triangulation is a 2-connected plane graph that has at most one face that is not a triangle. In this paper, we explore minimal cuts…

The primary objects of study in the ``knot theory of complex plane curves'' are C-links: links (or knots) cut out of a 3-sphere in the complex plane by complex plane transverse and totally tangential. Transverse C-links are naturally…

Let $T$ be a satellite knot, link, or spatial graph in a 3-manifold $M$ that is either $S^3$ or a lens space. Let $\mathfrak{b}_0$ and $\mathfrak{b}_1$ denote genus 0 and genus 1 bridge number, respectively. Suppose that $T$ has a companion…

Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrary planar graph to index the decomposition. We prove that…

We define a decomposition of link projections whose pieces we call atoroidal graphs. We describe a surgery operation on these graphs and show that all atoroidal graphs can be generated by performing surgery repeatedly on a family of well…

We find all maximal linklessly embeddable graphs of order up to 11, and verify that for every graph $G$ of order 11 either $G$ or its complement $cG$ is intrinsically linked. We give an example of a graph $G$ of order 11 such that both $G$…

A link at the origin of an isolated singularity of a two-dimensional semialgebraic surface in $\mathbb{R}^4$ is a topological knot (or link) in $S^3$. We study the connection between the ambient Lipschitz geometry of semialgebraic surface…