Related papers: The Connectivity Order of Links
We introduce and study so-called self-indexed graphs. These are (oriented) finite graphs endowed with a map from the set of edges to the set of vertices. Such graphs naturally arise from classical knot and link diagrams. In fact, the graphs…
We define a family of link concordance invariants $\left\{ s_n \right\}_{n=2,3, \cdots}$. These link concordance invariants give lower bounds on the slice genus of a link $L$. We compute the slice genus of positive links. Moreover, these…
A graph is k-linked if any k disjoint vertex-pairs can be joined by k disjoint paths. We improve a lower bound on the linkedness of polytopes slightly, which results in exact values for the minimal linkedness of 7-, 10- and 13-dimensional…
We classify graphs that are 0, 1, or 2 edges short of being complete partite graphs with respect to intrinsic linking and intrinsic knotting. In addition, we classify intrinsic knotting of graphs on 8 vertices. For graphs in these families,…
Necessary and sufficient conditions for a finite connected graph with a strict partial order on vertices to be a combinatorial invariant of pseudoharmonic function are obtained.
In this paper, we first endow the set of ribbon string links (up to isotopy) with a structure of a cyclic and of a cocyclic set. Next, we relate these (co)cyclic sets with those associated with the coend of a ribbon category. The…
In this paper, we construct two families of satellite constructions for Brunnian links, called the satellite sum and the satellite tie. An interesting fact is that by applying the satellite sum and the satellite tie constructions, we can…
We present a new theory which describes the collection of all tunnels of tunnel number 1 knots in the 3-sphere (up to orientation-preserving equivalence in the sense of Heegaard splittings) using the disk complex of the genus-2 handlebody…
We work with a generalization of knot theory, in which one diagram is reachable from another via a finite sequence of moves if a fixed condition, regarding the existence of certain morphisms in an associated category, is satisfied for every…
In this paper it is shown that for any network there is a uniquely determined network based on a structure tree that provides a convenient way of determining a minimal cut separating a pair $s, t$ where each of $s, t$ is either a vertex or…
Higher-order networks effectively represent complex systems with group interactions. Existing methods usually overlook the relative contribution of group interactions (hyperlinks) of different sizes to the overall network structure. Yet,…
A relationally exchangeable structure is a random combinatorial structure whose law is invariant with respect to relabeling its relations, as opposed to its elements. Aside from exchangeable random partitions, examples include edge…
We introduce a framework to analyze knots and links in an unmarked solid torus. We discuss invariants that detect when such links are equivalent under an ambient homeomorphism, and show that the multivariable Alexander polynomial is such in…
The present paper is an introduction to a combinatorial theory arising as a natural generalisation of classical and virtual knot theory. There is a way to encode links by a class of `realisable' graphs. When passing to generic graphs with…
Minimum braids are a complete invariant of knots and links. This paper defines minimum braids, describes how they can be generated, presents tables for knots up to ten crossings and oriented links up to nine crossings, and uses minimum…
The total homology of the loop space of the configuration space of ordered distinct n points in R^m has a structure of a Hopf algebra defined by the 4-term relations if m>2. We describe a relation of between the cohomology of this loop…
We describe a new class of minimal link diagrams. This class includes certain alternating diagrams, the standard diagrams of all torus links, and numerous homogeneous diagrams whose minimality has not been proven before. Besides, we…
We characterise all vertex-transitive finite connected graphs as essentially 5-connected or on a short list of explicit graph-classes. Our proof heavily uses Tutte-type canonical decompositions.
A simple graph G is k-ordered (respectively, k-ordered hamiltonian) if, for any sequence of k distinct vertices v_1, ..., v_k of G, there exists a cycle (respectively, a hamiltonian cycle) in G containing these k vertices in the specified…
A k-connected graph such that deleting any edge / deleting any vertex / contracting any edge results in a graph which is not k-connected is called minimally / critically / contraction-critically k-connected. These three classes play a…