相关论文: Replacing a graph clasper by tree claspers

We introduce the concept of `claspers,' which are surfaces in 3-manifolds with some additional structure on which surgery operations can be performed. Using claspers we define for each positive integer k an equivalence relation on links…

Goussarov-Habiro's theory of clasper surgeries defines a filtration of the monoid of string links $L(m)$ on $m$ strands, in a way that geometrically realizes the Feynman diagrams appearing in low-dimensional and quantum topology.…

We define an equivalence relation on graphs with signed edges, such that the associated adjacency matrices of two equivalent graphs are congruent over $\mathbb{Z}$. We show that signed graphs whose eigenvalues are larger than $-2$ are…

The study of string C-group representations of rank at least $n/2$ for the symmetric group $S_n$ has gained a lot of attention in the last fifteen years. In a recent paper, Cameron et al. gave a list of permutation representation graphs of…

We introduce a new equivalence relation on decorated ribbon graphs, and show that its equivalence classes directly correspond to virtual links. We demonstrate how this correspondence can be used to convert any invariant of virtual links…

Recently Swatee Naik and Theodore Stanford proved that two S-equivalent knots are related by a finite sequence of doubled-delta moves on their knot diagrams. We show that classical S-equivalence is not sufficient to extend their result to…

For each $\Delta>0$, we prove that there exists some $C=C(\Delta)$ for which the binomial random graph $G(n,C\log n/n)$ almost surely contains a copy of every tree with $n$ vertices and maximum degree at most $\Delta$. In doing so, we…

We give a complete classification of links up to clasp-pass moves, which coincides with Habiro's $C_3$-equivalence. We also classify links up to band-pass and band-# moves, which are versions of the usual pass- and #-move, respectively,…

In this paper, the easier methods of my thesis are applied to give a simple proof of a theorem of Goussarov. The theorem relates two possible notions of finite type equivalence of knots, links or string links, showing that the resulting…

We show that for any fixed dense graph G and bounded-degree tree T on the same number of vertices, a modest random perturbation of G will typically contain a copy of T . This combines the viewpoints of the well-studied problems of embedding…

A connected graph $G$, of order two or more, is matching covered if each edge lies in some \pema. The tight cut decomposition of a matching covered graph $G$ yields a list of bricks and braces; as per a theorem of Lov{\'a}sz~\cite{lova87},…

We show that all sufficiently large (2k+3)-connected graphs of bounded tree-width are k-linked. Thomassen has conjectured that all sufficiently large (2k+2)-connected graphs are k-linked.

Balister, the second author, Groenland, Johnston and Scott recently showed that there are asymptotically $C4^n/n^{3/4}$ many unordered sequences that occur as degree sequences of graphs. Combining limit theory for infinitely divisible…

Cliquewidth is a dense analogue of treewidth. It can be deduced from recent results by Hickingbotham [arXiv:2501.10840] and Nguyen, Scott, and Seymour [arXiv:2501.09839] that graphs of bounded cliquewidth are quasi-isometric to graphs of…

The operation of transforming one spanning tree into another by replacing an edge has been considered widely, both for general and planar straight-line graphs. For the latter, several variants have been studied (e.g., edge slides and edge…

In this paper, we present some new results describing connections between the spectrum of a regular graph and its generalized connectivity, toughness, and the existence of spanning trees with bounded degree.

Motivated by the problem of routing reliably and scalably in a graph, we introduce the notion of a splicer, the union of spanning trees of a graph. We prove that for any bounded-degree n-vertex graph, the union of two random spanning trees…

A class of graphs is bridge-addable if given a graph $G$ in the class, any graph obtained by adding an edge between two connected components of $G$ is also in the class. We prove a conjecture of McDiarmid, Steger, and Welsh, that says that…

We present an explicit connected spanning structure that appears in a random graph just above the connectivity threshold with high probability.

In previous work, the author defined the intersection graph of a chord diagram associated with string links (as in the theory of finite type invariants). In this paper, we classify the trees which can be obtained as intersection graphs of…