Related papers: Braid Index Bounds Ropelength From Below

The girth of a graph $G$ is the length of a shortest cycle of $G$. Jiang (JCT-B, 2001) showed that every graph $G$ with girth at least $2\ell+1$ and minimum degree at least $k/\ell$ contains every tree $T$ with $k$ edges whose maximum…

The tree-independence number of a graph is the minimum, over all tree-decompositions of the graph, of the maximum size of an independent set contained in a bag. Graph classes of bounded tree-independence number have strong structural and…

A knot (or link) diagram is said to be everywhere equivalent if all the diagrams obtained by switching one crossing represent the same knot (or link). We classify such diagrams of a closed 3-braid.

Let $G=(V,E)$ be a connected, finite undirected graph. A set $S \subseteq V$ is said to be a total dominating set of $G$ if every vertex in $V$ is adjacent to some vertex in $S$. The total domination number, $\gamma_{t}(G)$, is the minimum…

We prove that a connected graph has linear rank-width 1 if and only if it is a distance-hereditary graph and its split decomposition tree is a path. An immediate consequence is that one can decide in linear time whether a graph has linear…

Let $M$ be a connected, closed, oriented three-manifold and $K$, $L$ two rationally null-homologous oriented simple closed curves in $M$. We give an explicit algorithm for computing the linking number between $K$ and $L$ in terms of a…

The Carath\'eodory number k(K) of a pointed closed convex cone K is the minimum among all the k for which every element of K can be written as a nonnegative linear combination of at most k elements belonging to extreme rays.…

We prove that for any fixed r>=2, the tree-width of graphs not containing K_r as a topological minor (resp. as a subgraph) is bounded by a linear (resp. polynomial) function of their rank-width. We also present refinements of our bounds for…

The notion of a braided chord diagram is introduced and studied. An equivalence relation is given which identifies all braidings of a fixed chord diagram. It is shown that finite-type invariants are stratified by braid index for knots which…

This paper generalizes and unifies the existing spectral bounds on the $k$-independence number of a graph, which is the maximum size of a set of vertices at pairwise distance greater than $k$. The previous bounds known in the literature…

We study a knot type through the ropelength-filtered spaces of its thick representatives. For a knot type $K$ and a scale parameter $\Lambda>0$, let $Y_\Lambda(K)=\mathcal{R}_{1,\Lambda}(K)$ be the space of representatives of $K$ with…

Square grids play a pivotal role in Robertson and Seymour's work on graph minors as planar obstructions to small treewidth. We introduce a three-sided bramble in a plane graph called a net, which generalizes the standard bramble of crosses…

We show that for any nontrivial knot $K$ and any natural number $n$ there is a diagram $D$ of $K$ such that the unknotting number of $D$ is greater than or equal to $n$. It is well known that twice the unknotting number of $K$ is less than…

We study embeddings of graphs with bounded treewidth or bounded simple treewidth into the undirected graph underlying the directed product of two directed graphs. If the factors have bounded maximum indegrees, then the product graph has…

A tree with at most $k$ leaves is called a $k$-ended tree. A spanning 2-ended tree is a Hamilton path. A Hamilton cycle can be considered as a spanning 1-ended tree. The earliest result concerning spanning trees with few leaves states that…

We answer a question posed by Fielder in [1] concerning two notions of crossing number for algebraic knots $K$ under Hopf fibration, one topological, denoted $h(K)$, the other coming from the realization of such knots around complex…

An algebraic extension K of the rationals has the Bogomolov property if the absolute logarithmic height of non-torsion points of K* is bounded away from 0. We define a relative extension L/K to be Bogomolov if this holds for points of L\K.…

Let $\varphi_{n,K}$ denote the largest angle in all the triangles with vertices among the $n$ points selected at random in a compact convex subset $K$ of $\mathbb{R}^d$ with nonempty interior, where $d\ge2$. It is shown that the…

A signed graph $\Sigma=(G,\sigma)$ consists of an underlying graph $G=(V,E)$ with a sign function $\sigma:E\rightarrow\{-1,1\}$. Let $A(\Sigma)$ be the adjacency matrix of $\Sigma$ and $\lambda_1(\Sigma)$ denote the largest eigenvalue…

Kemeny's constant $\kappa(G)$ of a connected graph $G$ is a measure of the expected transit time for the random walk associated with $G$. In the current work, we consider the case when $G$ is a tree, and, in this setting, we provide lower…