Related papers: Links, bridge number, and width trees
We consider the in-plane motion of elastic strings on tree-like network, observed from the 'leaves'. We investigate the inverse problem of recovering not only the physical properties i.e. the 'optical lengths' of each string, but also the…
Graph theory is a branch of mathematics in which pair-wise relations between objects are studied. My PhD thesis, supervised by David R. Wood, introduces and investigates a new family of graphs, called link graphs, that generalises the…
We introduce a new equivalence relation on decorated ribbon graphs, and show that its equivalence classes directly correspond to virtual links. We demonstrate how this correspondence can be used to convert any invariant of virtual links…
Given any link $L\subseteq S^3$, we show that it is possible to embed an unknot $U$ in its complement so that the link $L\cup U$ satisfies the Meridional Rank Conjecture (MRC). The bridge numbers in our construction fit into the equality…
We construct classes of graphs that are variants of the so-called layered wheel. One of their key properties is that while the treewidth is bounded by a function of the clique number, the construction can be adjusted to make the dependance…
We define a coalgebra structure for open strings transverse to any framed codimension 2 submanifold. When the submanifold is a knot in R^3, we show this structure recovers a specialization of the Ng cord algebra, a non-trivial knot…
Labeled infinite trees provide combinatorial interpretations for many integer sequences generated by nested recurrence relations. Typically, such sequences are monotone increasing. Several of these sequences also have straightforward…
We use the knot homology of Khovanov and Lee to construct link concordance invariants generalizing the Rasmussen $s$-invariant of knots. The relevant invariant for a link is a filtration on a vector space of dimension $2^{|L|}$. The basic…
Knots and links in 3-manifolds are studied by applying intersection invariants to singular concordances. The resulting link invariants generalize the Arf invariant, the mod 2 Sato-Levine invariants, and Milnor's triple linking numbers.…
A vertex of degree one in a tree is called an end vertex and a vertex of degree at least three is called a branch vertex. For a graph $G$, let $\sigma_2$ be the minimum degree sum of two nonadjacent vertices in $G$. We consider tree…
For $d\ge 2$ and an odd prime power $q$, consider the vector space $\mathbb{F}_q^d$ over the finite field $\mathbb{F}_q$, where the distance between two points $(x_1,\ldots,x_d)$ and $(y_1,\ldots,y_d)$ is defined as $\sum_{i=1}^d…
We show that a small tree-decomposition of a knot diagram induces a small sphere-decomposition of the corresponding knot. This, in turn, implies that the knot admits a small essential planar meridional surface or a small bridge sphere. We…
We define a variation of Khovanov homology with an explicit description in terms of the spanning trees of a link projection. We prove that this new theory is a link invariant and describe some of its properties. Finally, we provide some the…
In this paper we introduce the tied links, i.e. ordinary links provided with some ties between strands. The motivation for introducing such objects originates from a diagrammatical interpretation of the defining generators of the so-called…
We study random knots and links in R^3 using the Petaluma model, which is based on the petal projections developed by Adams et al. (2012). In this model we obtain a formula for the distribution of the linking number of a random…
In this paper, we introduce two families of planar and self-similar graphs which have small-world properties. The constructed models are based on an iterative process where each step of a certain formulation of modules results in a final…
The \emph{distance-number} of a graph $G$ is the minimum number of distinct edge-lengths over all straight-line drawings of $G$ in the plane. This definition generalises many well-known concepts in combinatorial geometry. We consider the…
Phylogenetic trees and networks are leaf-labelled graphs used to model evolution. Display graphs are created by identifying common leaf labels in two or more phylogenetic trees or networks. The treewidth of such graphs is bounded as a…
Twisted torus knots and links are given by twisting adjacent strands of a torus link. They are geometrically simple and contain many examples of the smallest volume hyperbolic knots. Many are also Lorenz links. We study the geometry of…
We extend the Wirtinger number of links, an invariant originally defined by Blair, Kjuchukova, Velazquez, and Villanueva in terms of extending initial colorings of some strands of a diagram to the entire diagram, to spatial graphs. We prove…