Related papers: Recognizing trace graphs of closed braids

A multigraph is exactly k-edge-connected if there are exactly k edge-disjoint paths between any pair of vertices. We characterize the class of exactly 3-edge-connected graphs, giving a synthesis involving two operations by which every…

Let S be a compact, oriented surface with negative Euler characteristic and let f be a homeomorphism of S that is isotopic to the identity. If there exists a periodic orbit with a non-zero rotation vector, then there exists a simple braid…

We use grid diagrams to present a unified picture of braids, Legendrian knots, and transverse knots.

Let $\mathcal{A}$ be a set of positive numbers. A graph $G$ is called an $\mathcal{A}$-embeddable graph in $\mathbb{R}^d$ if the vertices of $G$ can be positioned in $\mathbb{R}^d$ so that the distance between endpoints of any edge is an…

We introduce the concept of tied links in the solid torus, which generalize naturally the concept of tied links in $S^3$ previously introduced by Aicardi and Juyumaya. We also define an invariant of these tied links by using skein…

We consider linear slices of the space of Kleinian once-punctured torus groups; a linear slice is obtained by fixing the value of the trace of one of the generators. The linear slice for trace 2 is called the Maskit slice. We will show that…

We introduce torsoids, a canonical structure in matching covered graphs, corresponding to the bricks and braces of the graph. This allows a more fine-grained understanding of the structure of finite and infinite directed graphs with respect…

The notion of a braid is generalized into two and three dimensions. Two-dimensional braids are described by braid monodromies or graphics called charts. In this paper we introduce the notion of curtains, and show that three-dimensional…

A simple braid is a positive braid that can be drawn so that any two strands cross at most once. We prove that as $n \to \infty$, the proportion of simple braids on $n$ strands that have positive topological entropy tends toward $100\%$.…

We identify the group of framed diffeomorphisms of the torus as a semi-direct product of the torus with the braid group on 3 strands; we also identify the topological monoid of framed local-diffeomorphisms of the torus in similar terms. It…

A calligraph is a graph that for almost all edge length assignments moves with one degree of freedom in the plane, if we fix an edge and consider the vertices as revolute joints. The trajectory of a distinguished vertex of the calligraph is…

A graph $X$ is 2-spanning cyclable if for any pair of distinct vertices $u$ and $v$ there is a 2-factor of $X$ consisting of two cycles such that $u$ and $v$ belong to distinct cycles. In this paper we examine the 2-spanning cyclability of…

We prove several results about chordal graphs and weighted chordal graphs by focusing on exposed edges. These are edges that are properly contained in a single maximal complete subgraph. This leads to a characterization of chordal graphs…

A disconnected cut of a connected graph is a vertex cut that itself also induces a disconnected subgraph. The decision problem whether a graph has a disconnected cut is called Disconnected Cut. This problem is closely related to several…

We classify positive transversal torus knots in tight contact structures up to transversal isotopy.

Knot contact homology is an invariant of knots derived from Legendrian contact homology which has numerous connections to the knot group. We use basic properties of knot groups to prove that knot contact homology detects every torus knot.…

A tree with at most k leaves is called k-ended tree, and a tree with exactly k leaves is called k-end tree, where a leaf is a vertex of degree one. Contraction of a graph G along the edge e means deleting the edge e and identifying its end…

In the context of a random walk on an undirected graph, Kemeny's constant can measure the average travel time for a random walk between two randomly chosen vertices. We are interested in graphs that behave counter-intuitively in regard to…

A graph on at least ${{k+1}}$ vertices is uniformly $k$-connected if each pair of its vertices is connected by $k$ and not more than $k$ independent paths. We reinvestigate a recent constructive characterization of uniformly $3$-connected…

Let $G$ be a 3-connected planar graph. Define the co-tree of a spanning tree $T$ of $G$ as the graph induced by the dual edges of $E(G)-E(T)$. The well-known cut-cycle duality implies that the co-tree is itself a tree. Let a $k$-tree be a…