Related papers: Links, bridge number, and width trees

Tree-based networks are a class of phylogenetic networks that attempt to formally capture what is meant by "tree-like" evolution. A given non-tree-based phylogenetic network, however, might appear to be very close to being tree-based, or…

We study random $k$-connected chordal graphs with bounded tree-width. Our main results are scaling limits and quenched local limits.

A graph is odd if all of its vertices have odd degrees. In particular, an odd spanning tree in a connected graph is a spanning tree in which all vertices have odd degrees. In this paper we establish a unified technique to enumerate odd…

We study configuration space integral formulas for Milnor's homotopy link invariants, showing that they are in correspondence with certain linear combinations of trivalent trees. Our proof is essentially a combinatorial analysis of a…

We investigate connections between biquandle colorings, quiver enhancements, and several notions of the bridge numbers $b_i(K)$ for virtual links, where $i=1,2$. We show that for any positive integers $m \leq n$, there exists a virtual link…

Phylogenetic networks which are, as opposed to trees, suitable to describe processes like hybridization and horizontal gene transfer, play a substantial role in evolutionary research. However, while non-treelike events need to be taken into…

We give a simple proof that the straightforward generalisation of clique-width to arbitrary structures can be unbounded on structures of bounded tree-width. This can be corrected by allowing fusion of elements.

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…

We characterise digraphs of directed treewidth one in terms of forbidden butterfly minors. Moreover, we show that there is a linear relation between the hypertree-width of the dual of the cycle hypergraph of D, i. e. the hypergraph with…

We study the gordian graph of all knots in $\R^3$: two knots are adjacent if they differ by a single crossing change. We prove that this graph contains isometrically an infinite countable tree with infinite valency, and that the complement…

The following theorem is proved: For all $k$-connected graphs $G$ and $H$ each with at least $n$ vertices, the treewidth of the cartesian product of $G$ and $H$ is at least $k(n -2k+2)-1$. For $n\gg k$ this lower bound is asymptotically…

We study the height of a spanning tree $T$ of a graph $G$ obtained by starting with a single vertex of $G$ and repeatedly selecting, uniformly at random, an edge of $G$ with exactly one endpoint in $T$ and adding this edge to $T$.

Using the symplectic geometry of certain manifolds which appear naturally in Lie theory, we define an invariant which assigns a graded abelian group to an oriented link. The relevant manifolds are transverse slices to certain nilpotent…

We provide a finite equational presentation of graphs of treewidth at most three, solving an instanceof an open problem by Courcelle and Engelfriet. We use a syntax generalising series-parallel expressions, denoting graphs with a small…

We determine if the width of a graph class ${\cal G}$ changes from unbounded to bounded if we consider only those graphs from ${\cal G}$ whose diameter is bounded. As parameters we consider treedepth, pathwidth, treewidth and clique-width,…

When considering the number of subtrees of trees, the extremal structures which maximize this number among binary trees and trees with a given maximum degree lead to some interesting facts that correlate to other graphical indices in…

We present a new theory which describes the collection of all tunnels of tunnel number 1 knots in the 3-sphere (up to orientation-preserving equivalence in the sense of Heegaard splittings) using the disk complex of the genus-2 handlebody…

We define an annular concordance invariant and study its properties. When specialized to braids, this invariant gives bounds on band rank. We introduce a modified chain complex to reformulate the invariant. Then, by focusing on a special…

Birmele [J. Graph Theory, 2003] proved that every graph with circumference t has treewidth at most t-1. Under the additional assumption of 2-connectivity, such graphs have bounded pathwidth, which is a qualitatively stronger result.…

We continue to develop an obstruction theory for embedding 2-spheres into 4-manifolds in terms of Whitney towers. The proposed intersection invariants take values in certain graded abelian groups generated by labelled trivalent trees, and…