相关论文: On the fibration of augmented link complements

We show that all sufficiently large (2k+3)-connected graphs of bounded tree-width are k-linked. Thomassen has conjectured that all sufficiently large (2k+2)-connected graphs are k-linked.

We prove some conditions for the existence of higher dimensional algebraic fibering of group extensions. This leads to various corollaries on incoherence of groups and some geometric examples of algebraic fibers of type $F_n$ but not…

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…

In this paper, we study fan-planar drawings that use $h$ layers and are proper, i.e., edges connect adjacent layers. We show that if the embedding of the graph is fixed, then testing the existence of such drawings is fixed-parameter…

Latent fibrations are an adaptation, appropriate for categories of partial maps (as presented by restriction categories), of the usual notion of fibration. The paper initiates the development of the basic theory of latent fibrations and…

In a multiplex network, a set of nodes is connected by different types of interactions, each represented as a separate layer within the network. Multiplexes have emerged as a key instrument for modeling large-scale complex systems, due to…

Diophantine tuples are of ancient and modern interest, with a huge literature. In this paper we study Diophantine graphs, i.e., finite graphs whose vertices are distinct positive integers, and two vertices are linked by an edge if and only…

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…

Associated to every state surface for a knot or link is a state graph, which embeds as a spine of the state surface. A state graph can be decomposed along cut-vertices into graphs with induced planar embeddings. Associated with each such…

Motivated by applications to graph morphing, we consider the following \emph{compatible connectivity-augmentation problem}: We are given a labelled $n$-vertex planar graph, $\mathcal{G}$, that has $r\ge 2$ connected components, and $k\ge 2$…

Let $M$ be a fibered 3-manifold with multiple boundary components. We show that the fiber structure of $M$ transforms to closely related transversely oriented taut foliations realizing all rational multislopes in some open neighborhood of…

We consider real spectra, collections of Z/(2)-spaces indexed over Z oplus Z alpha with compatibility conditions. We produce fibrations connecting the homotopy fixed points and the spaces in these spectra. We also evaluate the map which is…

Motivated by very large-scale communication networks, we newly introduce exponentiation of graphs. Using the exponential operation on graphs, we can construct various graphs of multi-exponential order with logarithmic diameter. We show that…

Any leafwise connection on a fibre bundle over a foliated manifold is proved to come from a connection on this fibre bundle.

There is one generalization of fibered links in 3-manifolds, called homologically fibered links. It is known that the existence of homologically fibered links whose fiber surface has a given homeomorphic type is determined by the first…

Branched actin networks exert pushing forces in eukaryotic cells, and adapt their stiffness to their environment. The physical basis for their mechanics and adaptability is however not understood. Indeed, here we show that their high…

We initiate the algorithmic study of the following "structured augmentation" question: is it possible to increase the connectivity of a given graph G by superposing it with another given graph H? More precisely, graph F is the superposition…

We consider drawings of graphs that contain dense subgraphs. We introduce intersection-link representations for such graphs, in which each vertex $u$ is represented by a geometric object $R(u)$ and in which each edge $(u,v)$ is represented…

We develop a word mechanism applied in knot and link diagrams for the illustration of a diagrammatic property. We also give a necessary condition for determining incompressible and pairwise incompressible surfaces, that are embedded in knot…

This manuscript serves as an online supplement of a preprint, which presents a study on a kind of bilayer networks where some nodes (called interconnecting nodes) in two layers merge. A model showing an important general property of the…