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

We present an algorithm to support the dynamic embedding in the plane of a dynamic graph. An edge can be inserted across a face between two vertices on the face boundary (we call such a vertex pair linkable), and edges can be deleted. The…

We provide a framework for extensions of Lie algebroids, including non-abelian extensions and Lie algebroids over different bases. Our approach involves Ehresmann connections, which allows straight generalizations of classical…

Alternative proof is given for an earlier presented result that if a link in 3-space bounds a compact oriented proper surface (without closed component) in the upper half 4-space, then the link bounds a ribbon surface in the upper half…

We consider the connectivity of fiber graphs with respect to Gr\"obner basis and Graver basis moves. First, we present a sequence of fiber graphs using moves from a Gr\"obner basis and prove that their edge-connectivity is lowest possible…

For a fibration with the fiber $K(\pi,n)$-space, the algebraic model as a twisted tensor product of chains of the base with standard chains of $K(\pi,n)$-complex is given which preserves multiplicative structure as well. In terms of this…

We study linkedness of Cartesian product of graphs and prove that the product of an $a$-linked and a $b$-linked graphs is $(a+b-1)$-linked if the graphs are sufficiently large. Further bounds in terms of connectivity are shown. We determine…

In the main part of this paper a connection is just a fiber projection onto a (not necessarily integrable) distribution or sub vector bundle of the tangent bundle. Here curvature is computed via the Froelicher-Nijenhuis bracket, and it is…

A branch vertex in a tree is a vertex of degree at least three. We prove that, for all $s\geq 1$, every connected graph on $n$ vertices with minimum degree at least $(\frac{1}{s+3}+o(1))n$ contains a spanning tree having at most $s$ branch…

We define the notion of affine rigidity of a hypergraph and prove a variety of fundamental results for this notion. First, we show that affine rigidity can be determined by the rank of a specific matrix which implies that affine rigidity is…

The octahedral decomposition of classical link complements has been considered and utilised by Weeks, Rubinstein, Sakuma etc. It is even more natural to consider the octahedral decomposition of virtual link complements. In this paper, we…

A population of complete subgraphs or cliques in a network evolving via duplication-divergence is considered. We find that a number of cliques of each size scales linearly with the size of the network. We also derive a clique population…

In this paper, we consider local moves on classical and welded diagrams of string links, and the notion of welded extension of a classical move. Such extensions being non-unique in general, the idea is to find a topological criterion which…

We show that if a knot admits a prime, twist-reduced diagram with at least 4 twist regions and at least 6 crossings per twist region, then every non-trivial Dehn filling of that knot is hyperbolike. A similar statement holds for links. We…

For any locally cartesian closed category E, we prove that a local fibered right adjoint between slices of E is given by a polynomial. The slices in question are taken in a well known fibered sense.

Phylogenetic networks are becoming of increasing interest to evolutionary biologists due to their ability to capture complex non-treelike evolutionary processes. From a combinatorial point of view, such networks are certain types of rooted…

We study the behavior of algebraic connectivity in a weighted graph that is subject to site percolation, random deletion of the vertices. Using a refined concentration inequality for random matrices we show in our main theorem that the…

We show that any smooth one-dimensional link in the real projective three-plane is the fixed-point locus of a smooth symplectic surface in the complex projective three-plane which is invariant under complex conjugation. The degree of the…

This paper investigates some relationship between the algebraic connectivity and the clique number of graphs. We characterize all extremal graphs which have the maximum and minimum the algebraic connectivity among all graphs of order $n$…

We define a special case of tree decompositions for planar graphs that respect a given embedding of the graph. We study the analogous width of the resulting decomposition we call the embedded-width of a plane graph. We show both upper…

We study intrinsically linked graphs where we require that every embedding of the graph contains not just a non-split link, but a link that satisfies some additional property. Examples of properties we address in this paper are: a two…