Related papers: Fiber detection for state surfaces

The $k$-leaf power graph $G$ of a tree $T$ is a graph whose vertices are the leaves of $T$ and whose edges connect pairs of leaves at unweighted distance at most~$k$ in $T$. Recognition of the $k$-leaf power graphs for $k \geq 7$ is still…

Luo, Tian and Wu conjectured in 2022 that for any tree $T$ with bipartition $X$ and $Y$, every $k$-connected bipartite graph $G$ with $\delta(G) \geq k + t$, where $t = \max\{|X|,|Y |\}$, contains a subtree $T' \cong T$ such that $G-V(T')$…

We prove that if $f\colon X\to Y$ is a closed surjective map between metric spaces such that every fiber $f^{-1}(y)$ belongs to a class of space $\mathrm S$, then there exists an $F_\sigma$-set $A\subset X$ such that $A\in\mathrm S$ and…

A spanning subgraph $F$ of a graph $G$ is called perfect if $F$ is a forest, the degree $d_F(x)$ of each vertex $x$ in $F$ is odd, and each tree of $F$ is an induced subgraph of $G$. We provide a short proof of the following theorem of A.D.…

Jaeger [Geom. Dedicata 44 (1992), 23-52] discovered a remarkable checkerboard state model based on the Higman-Sims graph that yields a value of the Kauffman polynomial, which is a quantum invariant of links. We present a simple argument…

A knot $K$ is definite if $|\sigma(K)| = 2g(K)$. We prove that the quotient of a definite periodic knot is definite by considering equivariant minimal genus Seifert surfaces.

Let $f:X@>>>\Bbb P^1$ be a fibered surface with fibers of genus g>1. If f is semistable and non isotrivial we prove that X of non negative Kodaira dimension implies that the number s of singular fibers is at least 5. Information about the…

Let $G$ be a nontrivial connected graph of order $n$ and let $k$ be an integer with $2\leq k\leq n$. For a set $S$ of $k$ vertices of $G$, let $\kappa (S)$ denote the maximum number $\ell$ of edge-disjoint trees $T_1,T_2,...,T_\ell$ in $G$…

A tree $T$ in an edge-colored graph is called a {\it proper tree} if no two adjacent edges of $T$ receive the same color. Let $G$ be a connected graph of order $n$ and $k$ be an integer with $2\leq k \leq n$. For $S\subseteq V(G)$ and $|S|…

Given a knot in $S^3$, one can associate to it a surface diffeomorphism in two different ways. First, an arbitrary knot in $S^{3}$ can be represented by braids, which can be thought of as diffeomorphisms of punctured disks. Second, if the…

We prove that every connected graph with $s$ vertices of degree not 2 has a spanning tree with at least ${1\over 4}(s-2)+2$ leaves. Let $G$ be a be a connected graph of girth $g$ with $v>1$ vertices. Let maximal chain of successively…

For integer $k\geq2,$ a graph $G$ is called $k$-leaf-connected if $|V(G)|\geq k+1$ and given any subset $S\subseteq V(G)$ with $|S|=k,$ $G$ always has a spanning tree $T$ such that $S$ is precisely the set of leaves of $T.$ Thus a graph is…

The strong thin tree conjecture states that every $k$-edge-connected graph $G$ contains an $O(1/k)$-thin spanning tree, meaning a spanning tree which contains at most an $O(1/k)$ fraction of the edges across each cut in $G$. This conjecture…

We prove that every (6k + 2l, 2k)-connected simple graph contains k rigid and l connected edge-disjoint spanning subgraphs. This implies a theorem of Jackson and Jord\'an [4] and a theorem of Jord\'an [6] on packing of rigid spanning…

Suppose $R$ is a commutative ring with identity and a fixed invertible element $q^{\frac{1}{2}}$ such that $q+q^{-1}$ is invertible. For an oriented surface $\Sigma$, let $\mathcal{S}(\Sigma;R)$ denote the Kauffman bracket skein algebra of…

The connected tree-width of a graph is the minimum width of a tree-decomposition whose parts induce connected subgraphs. Long cycles are examples of graphs that have small tree-width but large connected tree-width. We show that a graph has…

A tree is called k-ended tree if it has at most k leaves, where a leaf is a vertex of degree one. In this paper we prove that every 3-regular connected graph with n vertices such that n is greater than 8 has spanning sub tree with at most…

Let $X^4$ and $Y^4$ be smooth manifolds and $f: X\to Y$ a branched cover with branching set $B$. Classically, if $B$ is smoothly embedded in $Y$, the signature $\sigma(X)$ can be computed from data about $Y$, $B$ and the local degrees of…

Let $G$ be a graph and $S\subseteq V(G)$ with $|S|\geq 2$. Then the trees $T_1, T_2, \cdots, T_\ell$ in $G$ are \emph{internally disjoint Steiner trees} connecting $S$ (or $S$-Steiner trees) if $E(T_i) \cap E(T_j )=\emptyset$ and…

Let $k$ and $n$ be integers such that $1\leq k \leq n-1$, and let $G$ be a simple graph of order $n$. The $k$-token graph $F_k(G)$ of $G$ is the graph whose vertices are the $k$-subsets of $V(G)$, where two vertices are adjacent in $F_k(G)$…