Related papers: Links, bridge number, and width trees

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…

We define a generalization of virtual links to arbitrary dimensions by extending the geometric definition due to Carter et al. We show that many homotopy type invariants for classical links extend to invariants of virtual links. We also…

Treewidth is a graph parameter of fundamental importance to algorithmic and structural graph theory. This paper surveys several graph parameters tied to treewidth, including separation number, tangle number, well-linked number and Cartesian…

We associate at each link a connectivity space which describes its splittability properties. Then, the notion of order for finite connectivity spaces results in the definition of a new numerical invariant for links, their connectivity…

Directed graphs are widely used in modelling of nonsymmetric relations in various sciences and engineering disciplines. We discuss invariants of strongly connected directed graphs - minimal number of vertices or edges necessary to remove to…

The Pathwidth Theorem states that if a class of graphs has unbounded pathwidth, then it contains all trees as graph minors. We prove a similar result for dense graphs. More precisely, we give a finite family of tree-like patterns and prove…

We define two new families of invariants for (3-manifold, graph) pairs which detect the unknot and are additive under connected sum of pairs and (-1/2)-additive under trivalent vertex sum of pairs. The first of these families is closely…

We extend the notion of intersection graphs for knots in the theory of finite type invariants to string links. We use our definition to develop weight systems for string links via the adjacency matrix of the intersection graph, and show…

Meier and Zupan showed that every surface in the four-sphere admits a bridge trisection and can therefore be represented by three simple tangles. This raises the possibility of applying methods from link homology to knotted surfaces. We use…

We find further evidence for the conjecture relating large N Chern-Simons theory on S^3 with topological string on the resolved conifold geometry by showing that the Wilson loop observable of a simple knot on S^3 (for any representation)…

Inspired by a width invariant on permutations defined by Guillemot and Marx, Bonnet, Kim, Thomass\'e, and Watrigant introduced the twin-width of graphs, which is a parameter describing its structural complexity. This invariant has been…

We define an integer valued invariant for two-component links in S^3 by counting projective SU(2) representations of the link group having non-trivial second Stiefel-Whitney class. We show that our invariant is, up to sign, the linking…

We introduce the concept of tied links in the solid torus, which generalize naturally the concept of tied links in $S^3$ previously introduced by Aicardi and Juyumaya. We also define an invariant of these tied links by using skein…

We introduce topological invariants of knots and braid conjugacy classes, in the form of differential graded algebras, and present an explicit combinatorial formulation for these invariants. The algebras conjecturally give the relative…

We discuss a notion of convergence for binary trees that is based on subtree sizes. In analogy to recent developments in the theory of graphs, posets and permutations we investigate some general aspects of the topology, such as a…

Gurski and Wanke showed that a graph class C has bounded tree-width if and only if its associated class of directed line graphs has bounded clique-width. Inevitably -- asking whether this relationship lifts to directed graphs -- we…

Using Maslov indices, we show the existence of oriented link invariants with values in the Witt rings of certain fields. Various classical invariants are closely related to this construction. We also explore a surprising connection with the…

Consider the nearest neighbor graph for the integer lattice Z^d in d dimensions. For a large finite piece of it, consider choosing a spanning tree for that piece uniformly among all possible subgraphs that are spanning trees. As the piece…

We study questions inspired by Erd\H os' celebrated distance problems with dot products in lieu of distances, and for more than a single pair of points. In particular, we study point configurations present in large finite point sets in the…

We introduce the problem of finding a spanning tree along with a partition of the tree edges into fewest number of feasible sets, where constraints on the edges define feasibility. The motivation comes from wireless networking, where we…