相关论文: Intrinsic linking and knotting are arbitrarily com…
Let $K$ be a knot type for which the quadratic term of the Conway polynomial is nontrivial, and let $\gamma: \mathbb{R}\to \mathbb{R}^3$ be an analytic $\mathbb{Z}$-periodic function with non-vanishing derivative which parameterizes a knot…
We prove that, for every $\ell\geq 4$, there exists an $\ell$-vertex graph and a first order sentence having a quantifier depth at most $\ell-1$ defining the property of having an induced subgraph isomorphic to the given one. We prove that…
In 1930, Ramsey proved that every infinite graph contains either an infinite clique or an infinite independent set as an induced subgraph. K\"{o}nig proved that every infinite graph contains either a ray or a vertex of infinite degree. In…
A convex combination mapping of a planar graph is a plane mapping in which the external vertices are mapped to the corners of a convex polygon and every internal vertex is a proper weighted average of its neighbours. If a planar graph is…
We characterize which automorphisms of an arbitrary complete bipartite graph $K_{n,m}$ can be induced by a homeomorphism of some embedding of the graph in $S^3$.
If L_1 and L_2 are two Brunnian links with all pairwise linking numbers 0, then we show that L_1 and L_2 are equivalent if and only if they have homeomorphic complements. In particular, this holds for all Brunnian links with at least three…
The main result of this paper is that for every closed, connected, orientable, irreducible 3-manifold $M$, there is an integer $ n_M$ such that any abstract graph with no automorphism of order 2 which has a 3-connected minor whose genus is…
We show that embedding calculus invariants $ev_n$ are surjective for long knots in an arbitrary $3$-manifold. This solves some remaining open cases of Goodwillie--Klein--Weiss connectivity estimates, and at the same time confirms one half…
We find a single two-parameter skein relation on trivalent graphs, the quantum exceptional relation, that specializes to a skein relation associated to each exceptional Lie algebra (in the adjoint representation). If a slight strengthening…
We prove that every graph $G$ on $n$ vertices with no isolated vertices contains an induced subgraph of size at least $n/10000$ with all degrees odd. This solves an old and well-known conjecture in graph theory.
In view of the self-linking invariant, the number $|K|$ of framed knots in $S^3$ with given underlying knot $K$ is infinite. In fact, the second author previously defined affine self-linking invariants and used them to show that $|K|$ is…
We derive an inductive, combinatorial definition of a polynomial-valued regular isotopy invariant of links and tangled graphs. We show that the invariant equals the Reshetikhin-Turaev invariant corresponding to the exceptional simple Lie…
We introduce a new combinatorial method to encode knots and links with applications to knot invariants. Clasp diagrams defined in this paper are combinatorial blueprints for building knot diagrams out of full twists on two strings rather…
This paper examines the relationship between the knotting of an embedded surface in $\R^3$ and the knotting of its fold curves, formed by the singular set of projection to a plane. The first result shows that every surface, no matter how…
We realize a homological block of a knot complement in $S^3$ for $G_{\mathbb{C}}=SL(2,\mathbb{C})$ as a half-index of a 3d $\mathcal{N}=2$ theory via an expression of the homological block as an inverted Habiro series by working out some…
We show that deleting an edge of a 3-cycle in an intrinsically knotted graph gives an intrinsically linked graph.
We show that the second coefficient of the Conway knot polynomial is annihilated by the Hamiltonian constraint of canonically quantized general relativity in the loop representation. The calculations are carried out in a fully regularized…
An explicit formula for the $A$-polynomial of the knot having Conway's notation $C(2n,4)$ is computed up to repeated factors. Our polynomial contains exactly the same irreducible factors as the $A$-polynomial defined in~\cite{CCGLS1}.
It is well known how the linking number and framing can be extracted from the degree 1 part of the (framed) Kontsevich integral. This note gives a general formula expressing any product of powers of these two invariants as combination of…
A matching $M$ in a graph $G$ is {\em connected} if $G$ has an edge linking each pair of edges in $M$. The problem to find large connected matchings in graphs $G$ with $\alpha(G)=2$ is closely related to Hadwiger's conjecture for graphs…