Related papers: Fiber detection for state surfaces

In this paper we define alternating Kauffman states of links and we characterize when the induced state surface is a fiber. In addition, we give a different proof of a similar theorem of Futer, Kalfagianni and Purcell on homogeneous states.

State surfaces are spanning surfaces of links that are obtained from link diagrams guided by the combinatorics underlying Kauffman's construction of the Jones polynomial via state models. Geometric properties of such surfaces are often…

Associated to every state surface for a knot or link is a state graph, which embeds as a spine of the state surface. A state graph can be decomposed along cut-vertices into graphs with induced planar embeddings. Associated with each such…

A $k$-ended tree is a tree with at most $k$ leaves. In this note, we give a simple proof for the following theorem. Let $G$ be a connected graph and $k$ be an integer ($k\geq 2$). Let $S$ be a vertex subset of $G$ such that $\alpha_{G}(S)…

We define an algorithm k which takes a connected graph G on a totally ordered vertex set and returns an increasing tree R (which is not necessarily a subtree of G). We characterize the set of graphs G such that k(G)=R. Because this set has…

For a graph $G=(V,E)$ and a set $S\subseteq V(G)$ of size at least $2$, an $S$-Steiner tree $T$ is a subgraph of $G$ that is a tree with $S\subseteq V(T)$. Two $S$-Steiner trees $T$ and $T'$ are internally disjoint (resp. edge-disjoint) if…

Hasunuma [J. Graph Theory 102 (2023) 423-435] conjectured that for any tree $T$ of order $m$, every $k$-connected (or $k$-edge-connected) graph $G$ with minimum degree at least $k+m-1$ contains a tree $T'\cong T$ such that $G-E(T')$ is…

The tree spanner problem for a graph $G$ is as follows: For a given integer $k$, is there a spanning tree $T$ of $G$ (called a tree $k$-spanner) such that the distance in $T$ between every pair of vertices is at most $k$ times their…

In 1998, Broersma and Tuinstra [J. Graph Theory \textbf{29} (1998), 227-237] proved that if $G$ is a connected graph satisfying $\sigma_2(G) \geq |G|-k+1$ then $G$ has a spanning $k-$ended tree. They also gave an example to show that the…

We study a canonical spanning surface obtained from a knot or link diagram depending on a given Kauffman state, and give a sufficient condition for the surface to be essential. By using the essential surface, we can see the triviality and…

This paper present a geometric diagram of a separable state: If a mixed state $\sigma $ is separable, there are $2^{nS(\sigma)}$ linearly independant product vectors which span the same Hilbert space as the $2^{nS(\sigma)}$ ``likely''…

We show that if a fibered knot $K$ is expressed as a band--connected sum of $K_1, \ldots, K_n$, then each $K_i$ is fibered, and the genus of $K$ is greater than or equal to that of the connected sum of $K_1,\ldots,K_n$.

This monograph derives direct and concrete relations between colored Jones polynomials and the topology of incompressible spanning surfaces in knot and link complements. Under mild diagrammatic hypotheses that arise naturally in the study…

We elaborate on the relations between surface states and squeezed states. First, we investigate two different criteria for determining whether a matter sector squeezed state is also a surface state and show that the two criteria are…

The paper is devoted to the problem when a map from some closed connected manifold to an aspherical closed manifold approximately fibers, i.e., is homotopic to Manifold Approximate Fibration. We define obstructions in algebraic K-theory.…

Cartesian product networks are always regarded as a tool for ``combining'' two given networks with established properties to obtain a new one that inherits properties from both. For a graph $F=(V,E)$ and a set $S\subseteq V(F)$ of at least…

An $\alpha$-thin tree $T$ of a graph $G$ is a spanning tree such that every cut of $G$ has at most an $\alpha$ proportion of its edges in $T$. The Thin Tree Conjecture proposes that there exists a function $f$ such that for any $\alpha >…

A graph $G$ is a $k$-leaf power if there exists a tree $T$ whose leaf set is $V(G)$, and such that $uv \in E(G)$ if and only if the distance between $u$ and $v$ in $T$ is at most $k$. The graph classes of $k$-leaf powers have several…

The bidimensionality of a set of vertices $X$ in a graph $G$ is the maximum $k$ for which $G$ contains as a $X$-rooted minor the $(k \times k)$-grid. This notion allows for the following version of the Graph Minors Structure Theorem (GMST)…

We show that if a graph is k-edge-connected, and we adjoin to it another graph satisfying a "contracted diameter less or equal to 2" condition, with minimal degree greater or equal to k, and some natural hypothesis on the edges connecting…