Related papers: The Connectivity Order of Links
Considering systems of separations in a graph that separate every pair of a given set of vertex sets that are themselves not separated by these separations, we determine conditions under which such a separation system contains a nested…
We find the minimal number of links in an embedding of any complete $k$-partite graph on 7 vertices (including $K_7$, which has at least 21 links). We give either exact values or upper and lower bounds for the minimal number of links for…
A polynomial is presented that models a topological knot in a unique manner. It distinguishes all types of knots including the orientation and has a group theory interpretation. The topologies may be labeled via a number, which upon a base…
A linkage is a finite graph with lengths assigned to each edge. A planar realization is a map to the plane which preserves edge lengths. It can be thought of as a mechanical device formed from stiff rods and rotating joints. We look at the…
Knots naturally appear in continuous dynamical systems as flow periodic trajectories. However, discrete dynamical systems are also closely connected with the theory of knots and links. For example, for Pixton diffeomorphisms, the…
Many of the structural characteristics of a network depend on the connectivity with and within the hubs. These dependencies can be related to the degree of a node and the number of links that a node shares with nodes of higher degree. In…
The main result of this paper is a new classification theorem for links (smooth embeddings in codimension 2). The classifying space is the rack space (defined in [Trunks and classifying spaces, Applied Categorical Structures, 3 (1995)…
It is well-known that no knot can be cancelled in a connected sum with another knot, whereas every link can be cancelled up to link homotopy in a (componentwise) connected sum with another link. In this paper we address the question whether…
We present a new structure theorem for finite fields of odd order that relates multiplicative and additive structure in an interesting way. This theorem has several applications, including an improved understanding of Dickson and Chebyshev…
Networks are a fundamental tool for understanding and modeling complex systems in physics, biology, neuroscience, engineering, and social science. Many networks are known to exhibit rich, lower-order connectivity patterns that can be…
We propose a gauge model of quantum electrodynamics (QED) and its nonabelian generalization from which we derive knot invariants such as the Jones polynomial. Our approach is inspired by the work of Witten who derived knot invariants from…
We consider the problem of constructing a communication infrastructure from scratch, for a collection of identical wireless nodes. Combinatorially, this means a) finding a set of links that form a strongly connected spanning graph on a set…
We consider countable linear orders and study the quasi-order of convex embeddability and its induced equivalence relation. We obtain both combinatorial and descriptive set-theoretic results, and further extend our research to the case of…
We study the connectivity of proper power graphs of some family of finite groups including nilpotent groups, groups with a non-trivial partition, and symmetric and alternating groups.
We define direct sums and a corresponding notion of connectedness for graph limits. Every graph limit has a unique decomposition as a direct sum of connected components. As is well-known, graph limits may be represented by symmetric…
It has been conjectured that the algebraic crossing number of a link is uniquely determined in minimal braid representation. This conjecture is true for many classes of knots and links. The Morton-Franks-Williams inequality gives a lower…
The Vassiliev-Gusarov link invariants of finite type are known to be closely related to perturbation theory for Chern-Simons theory. In order to clarify the perturbative nature of such link invariants, we introduce an algebra V_infinity…
A link L in the 3-sphere is called Brunnian if every proper sublink of L is trivial. In a previous paper, the first author proved that the restriction to Brunnian links of any Goussarov-Vassiliev finite type invariant of (n+1)-component…
In this paper we introduce a representation of knots and links called a cube diagram. We show that a property of a cube diagram is a link invariant if and only if the property is invariant under two types of cube diagram operations. A knot…
The present paper is a review of the current state of Graph-Link Theory (graph-links are also closely related to homotopy classes of looped interlacement graphs), dealing with a generalisation of knots obtained by translating the…