Related papers: Fiber detection for state surfaces

We define a knot to be $\gamma_0$-sharp if its Seifert genus is detected by the concordance invariant $\gamma_0$, which arises from the immersed curve formalism in bordered Heegaard Floer homology. We show that a connected sum of…

Stein proved that for each simple plane triangulation H there exists a partitioning of the vertex of H into two subsets each of which induces a forest if and only if the dual H^{*} has a Hamilton cycle. We extend the Stein theorem for…

Let $G$ be a graph with a spanning subgraph $F$, let $m$ be a positive integer, and let $f$ be a positive integer-valued function on $V(G)$. In this paper, we show that if for all $S\subseteq V(G)$, $$\Omega_m(G\setminus S)\le \sum_{v\in…

Eisermann has shown that the Jones polynomial of a $n$-component ribbon link $L\subset S^3$ is divided by the Jones polynomial of the trivial $n$-component link. We improve this theorem by extending its range of application from links in…

Let $\tau(G)$ and $\kappa'(G)$ denote the edge-connectivity and the spanning tree packing number of a graph $G$, respectively. Proving a conjecture initiated by Cioaba and Wong, Liu et al. in 2014 showed that for any simple graph $G$ with…

The concept of pedant tree-connectivity was introduced by Hager in 1985. For a graph $G=(V,E)$ and a set $S\subseteq V(G)$ of at least two vertices, \emph{an $S$-Steiner tree} or \emph{a Steiner tree connecting $S$} (or simply, \emph{an…

For every n-component ribbon link L we prove that the Jones polynomial V(L) is divisible by the polynomial V(O^n) of the trivial link. This integrality property allows us to define a generalized determinant det V(L) := [V(L)/V(O^n)]_(t=-1),…

We study the patterns of multipartite entanglement in Chern-Simons theory with compact simple gauge group $G$ and level $k$ for states defined by the path integral on ``link complements'', i.e., compact manifolds whose boundaries consist of…

Given a holomorphic family of Bridgeland stability conditions over a surface, we define a notion of spectral network which is an object in a Fukaya category of the surface with coefficients in a triangulated DG-category. These spectral…

A branch vertex in a tree is a vertex of degree at least three. We prove that, for all $s\geq 1$, every connected graph on $n$ vertices with minimum degree at least $(\frac{1}{s+3}+o(1))n$ contains a spanning tree having at most $s$ branch…

Let $G$ be a connected graph and $L(G)$ the set of all integers $k$ such that $G$ contains a spanning tree with exactly $k$ leaves. We show that for a connected graph $G$, the set $L(G)$ is contiguous. It follows from work of Chen, Ren, and…

Let v(G) be the number of vertices and t(G,k) the maximum number of disjoint k-edge trees in G. In this paper we show that (a1) if G is a graph with every vertex of degree at least two and at most s, where s > 3, then t(G,2) is at least…

The goal of this paper is twofold: (i) define a symplectic Khovanov type homology for a transverse link in a fibered closed $3$-manifold $M$ (with an auxiliary choice of a homotopy class of loops that intersect each fiber once) and (ii)…

Our main result is a full classification, for every connected graph $H$, of the computational complexity of Steiner Forest on $H$-subgraph-free graphs. To obtain this dichotomy, we establish the following new algorithmic, hardness, and…

Let $X$ be a smooth projective surface such that linear and numerical equivalence of divisors on $X$ coincide and let $\sigma\subseteq |D|$ be a linear pencil on $X$ with integral general fibers. A fiber of $\sigma$ will be called special…

Using the flow property of the R-matrix defining the colored Jones polynomial, we establish a natural bijection between the set of states on the part arc-graph of a link projection and the set of states on a corresponding bichromatic…

Mader [J. Combin. Theory Ser. B 40 (1986) 152-158] proved that every $k$-edge-connected graph $G$ with minimum degree at least $k+1$ contains a vertex $u$ such that $G-\{u\}$ is still $k$-edge-connected. In this paper, we prove that every…

A perfect $K_t$-matching in a graph $G$ is a spanning subgraph consisting of vertex disjoint copies of $K_t$. A classic theorem of Hajnal and Szemer\'edi states that if $G$ is a graph of order $n$ with minimum degree $\delta(G) \ge…

Let $X$ and $Y$ be any two graphs of order $n$. The friends-and-strangers graph $\mathsf{FS}(X,Y)$ of $X$ and $Y$ is a graph with vertex set consisting of all bijections $\sigma :V(X) \mapsto V(Y)$, in which two bijections $\sigma$,…

Atiyah's formulation of what is nowadays called the convexity theorem of Atiyah-Guillemin-Sternberg has two parts: (a) the image of the moment map arising from a Hamiltonian action of a torus on a symplectic manifold is a convex polytope,…