Related papers: Fiber detection for state surfaces

A vertex of degree one is called an end-vertex, and an end-vertex of a tree is called a leaf. A tree with at most $k$ leaves is called a $k$-ended tree. For a positive integer $k$, let $t_k$ be the order of a largest $k$-ended tree. Let…

A tree with at most k leaves is called k-ended tree, and a tree with exactly k leaves is called k-end tree, where a leaf is a vertex of degree one. Contraction of a graph G along the edge e means deleting the edge e and identifying its end…

In 1966, Cummins introduced the "tree graph": the tree graph $\mathbf{T}(G)$ of a graph $G$ (possibly infinite) has all its spanning trees as vertices, and distinct such trees correspond to adjacent vertices if they differ in just one edge,…

We generalize H. Seifert's algorithm for finding a Seifert surface for a knot or link. The generalization applies to "framed oriented measured lamination links." For knots, a Seifert surface determines a unique framing. In our setting, we…

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…

This paper presents a construction of fibered links $(K,\Sigma)$ out of chord diagrams $\sL$. Let $\Gamma$ be the incidence graph of $\sL$. Under certain conditions on $\sL$ the symmetrized Seifert matrix of $(K,\Sigma)$ equals the bilinear…

An edge in a $k$-connected graph $G$ is called {\em $k$-contractible} if the graph $G/e$ obtained from $G$ by contracting $e$ is $k$-connected. Generalizing earlier results on $3$-contractible edges in spanning trees of $3$-connected…

We prove that a simple knot in the lens space $L(p,q)$ fibers if and only if its order in homology does not divide any remainder occurring in the Euclidean algorithm applied to the pair $(p,q)$. One corollary is that if $p=m^2$ is a perfect…

In 2009, Kyaw proved that every $n$-vertex connected $K_{1,4}$-free graph $G$ with $\sigma_4(G)\geq n-1$ contains a spanning tree with at most $3$ leaves. In this paper, we prove an analogue of Kyaw's result for connected $K_{1,5}$-free…

Let $T$ be a tree, a vertex of degree one is called a leaf. The set of leaves of $T$ is denoted by $Leaf(T)$. The subtree $T-Leaf(T)$ of $T$ is called the stem of $T$ and denoted by $Stem(T).$ In this note, we give a sharp sufficient…

We consider two- and three-dimensional lattice models of proteins which were characterized previously. We coarse grain their folding dynamics by reducing it to transitions between effective states. We consider two methods of selection of…

Let $G$ be a 3-connected planar graph. Define the co-tree of a spanning tree $T$ of $G$ as the graph induced by the dual edges of $E(G)-E(T)$. The well-known cut-cycle duality implies that the co-tree is itself a tree. Let a $k$-tree be a…

This note contains a new proof of a theorem of Gang Xiao saying that the bicanonical map of a surface S of general type is generically finite if and only if the second plurigenus of S is strictly larger than 2. Such properties are also…

A tree in an edge-colored connected graph $G$ is called \emph{a rainbow tree} if no two edges of it are assigned the same color. For a vertex subset $S\subseteq V(G)$, a tree is called an \emph{$S$-tree} if it connects $S$ in $G$. A…

It is known that the minimal degree of the Jones polynomial of a positive knot is equal to its genus, and the minimal coefficient is 1. We extend this result to almost positive links and partly identify the 3 following coefficients for…

A graph is a $k$-leaf power of a tree $T$ if its vertices are leaves of $T$ and two vertices are adjacent in $T$ if and only if their distance in $T$ is at most $k$. Then $T$ is a $k$-leaf root of $G$. This notion was introduced by…

In this paper, we prove that every $n$-vertex connected $K_{1,5}$-free graph $G$ with $\sigma_4(G)\geq n-1$ contains a spanning tree with at most $5$ leaves and branch vertices in total. Moreover, the degree sum condition "$\sigma_4(G)\geq…

K\"onig's lemma is a fundamental result about trees with countless applications in mathematics and computer science. In contrapositive form, it states that if a tree is finitely branching and well-founded (i.e. has no infinite paths), then…

We use the skein theory of $\mathfrak{sl}_3$-webs to study the properties of the quantum $\mathfrak{sl}_3$-link polynomial of positive links. We give explicit formulae for the three leading terms of the polynomial on positive links in terms…

We study the fibration of augmented link complements. Given the diagram of an augmented link we associate a spanning surface and a graph. We then show that this surface is a fiber for the link complement if and only if the associated graph…