Related papers: Replacing a graph clasper by tree claspers

Real-world networks often exhibit strong transitivity with nontrivial local clustering spectra and degree correlations. Such features are not easily modeled in tractable network models, creating an obstacle to the theoretical understanding…

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…

We show that quasi-alternating links arise naturally when considering surgery on a strongly invertible L-space knot (that is, a knot that yields an L-space for some Dehn surgery). In particular, we show that for many known classes of…

Given a collection of graphs $\mathbf{G}=(G_1, \ldots, G_m)$ with the same vertex set, an $m$-edge graph $H\subset \cup_{i\in [m]}G_i$ is a transversal if there is a bijection $\phi:E(H)\to [m]$ such that $e\in E(G_{\phi(e)})$ for each…

We determine the sharp threshold for the containment of all $n$-vertex trees of bounded degree in random geometric graphs with $n$ vertices. This provides a geometric counterpart of Montgomery's threshold result for binomial random graphs,…

In this short note, we prove that every closed, oriented, connected 3-manifold arises as Dehn surgery along a braid positive link.

We investigate string graphs through the lens of graph product structure theory, which describes complicated graphs as subgraphs of strong products of simpler building blocks. A graph $G$ is called a string graph if its vertices can be…

This paper proves the reconstruction conjecture for graphs which are isomorphic to the cube of a tree. The proof uses the reconstructibility of trees from their peripheral vertex deleted subgraphs. The main result follows from (i)…

Connectivity query processing is a fundamental problem in graph processing. Given an undirected graph and two query vertices, the problem aims to identify whether they are connected via a path. Given frequent edge updates in real graph…

A sequence $D=(d_1,d_2,\ldots,d_n)$ of non-negative integers is called a graphic sequence if there is a simple graph with vertices $v_1,v_2,\ldots,v_n$ such that the degree of $v_i$ is $d_i$ for $1\leq i\leq n$. Given a graph theoretical…

In this paper, we apply Kauffman bracket skein algebras to develop a theory of skein adequate links in thickened surfaces. We show that any alternating link diagram on a surface is skein adequate. We apply our theory to establish the first…

A directed graph (digraph) $ D $ is $ k $-linked if $ |D| \geq 2k $, and for any $ 2k $ distinct vertices $ x_1, \ldots, x_k, y_1, \ldots, y_k $ of $ D $, there exist vertex-disjoint paths $ P_1, \ldots, P_k $ such that $ P_i $ is a path…

We show that every connected graph can be approximated by a normal tree, up to some arbitrarily small error phrased in terms of neighbourhoods around its ends. The existence of such approximate normal trees has consequences of both…

Traffic classification associates packet streams with known application labels, which is vital for network security and network management. With the rise of NAT, port dynamics, and encrypted traffic, it is increasingly challenging to obtain…

The class of cographs is one of the most well-known graph classes, which is also known to be equivalent to the class of $P_4$-free graphs. We show that Mader's conjecture is true if we restrict ourselves to cographs, that is, for any tree…

We prove that if a tree $T$ has $n$ vertices and maximum degree at most $\Delta$, then a copy of $T$ can almost surely be found in the random graph $\mathcal{G}(n,\Delta\log^5 n/n)$.

Finding coarse representations of large graphs is an important computational problem in the fields of scientific computing, large scale graph partitioning, and the reduction of geometric meshes. Of particular interest in all of these fields…

We construct a graph G such that any embedding of G into R^{3} contains a nonsplit link of two components, where at least one of the components is a nontrivial knot. Further, for any m < n we produce a graph H so that every embedding of H…

Recently, so-called treebased phylogenetic networks have gained considerable interest in the literature, where a treebased network is a network that can be constructed from a phylogenetic tree, called the base tree, by adding additional…

We introduce new sufficient conditions for intrinsic knotting and linking. A graph on n vertices with at least 4n-9 edges is intrinsically linked. A graph on n vertices with at least 5n-14 edges is intrinsically knotted. We also classify…