相关论文: Two more proofs that the Kinoshita graph is knotte…
We study the twisting fault emerging in circular knitting and its relation to the mathematical concepts of framing curves and the Gauss linking integral. We create three knitted bands with framing zero, one, and negative two, and use three…
A generic immersion of a circle into a $2$-sphere is often studied as a projection of a knot; it is called a knot projection. A chord diagram is a configuration of paired points on a circle; traditionally, the two points of each pair are…
In this article we investigate the structure of uniformly $k$-connected and uniformly $k$-edge-connected graphs. Whereas both types have previously been studied independent of each other, we analyze relations between these two classes. We…
We initiate the study of classical knots through the homotopy class of the n-th evaluation map of the knot, which is the induced map on the compactified n-point configuration space. Sending a knot to its n-th evaluation map realizes the…
These notes present two normal surface theory algorithms to detect the unknot and use the split-link algorithm to prove that the figure-eight knot is knotted.
A graph $G$ is said to be perfectly divisible if for every induced subgraph $H$ of $G$ with at least one edge, the vertex set $V(H)$ can be partitioned into two sets $A, B$ such that $H[A]$ is perfect and $\omega(B) < \omega(H)$. It is easy…
In this paper, we study the structure of braid graphs in simply-laced Coxeter systems. We prove that every reduced expression has a unique factorization as a product of so-called links, which in turn induces a decomposition of the braid…
The convex hull of a set K in space consists of points which are, in a certain sense, "surrounded" by K. When K is a closed curve, we define its higher hulls, consisting of points which are "multiply surrounded" by the curve. Our main…
This paper is an exploration of simple four-regular graphs in the plane (i.e. loopless and with no more than one edge between any two nodes). Such graphs are fundamental to the theory of knots and links in three dimensional space, and their…
We show that if the two parts of a finite bipartite graph have the same degree sequence, then there is a bipartite graph, with the same degree sequences, which is symmetric, in that it has an involutive graph automorphism that interchanges…
We give the first examples of a pair of knots $K_1$,$K_2$ in the 3-sphere for which their unknotting numbers satisfy $u(K_1\#K_2)<u(K_1)+u(K_2)$ . This answers question 1.69(B) from Kirby's problem list, "Problems in low-dimensional…
We compute the quadratic embedding constant for complete bipartite graphs with disjoint edges removed. Moreover, we study the quadratic embedding property for theta graphs, i.e., graphs consisting of three paths with common initial points…
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical properties of transition systems. We are interested in the…
An embedding of a graph in $3$-space is linkless if for every two disjoint cycles there exists an embedded ball that contains one of the cycles and is disjoint from the other. We prove that every bipartite linklessly embeddable (simple)…
For integers $n\geq k\geq 1$, the Kneser graph $K(n,k)$ is the graph with vertex set $V=[n]^{(k)}$ and edge set $E=\{\{x,y\} \in V^{(2)}: x\cap y=\emptyset\}$. Chen proved that for $n\geq 3k$, Kneser graphs are Hamiltonian and later…
A Kirchhoff graph is a vector graph with orthogonal cycles and vertex cuts. An algorithm has been developed that constructs all the Kirchhoff graphs up to a fixed edge multiplicity. This algorithm is used to explore the structure of prime…
The graph reconstruction conjecture states that all graphs on at least three vertices are determined up to isomorphism by their deck. In this paper, a general framework for this problem is proposed to simply explain the reconstruction of…
The well-known 1-2-3 Conjecture asserts that the edges of every graph without isolated edges can be weighted with $1$, $2$ and $3$ so that adjacent vertices receive distinct weighted degrees. This is open in general, while it is known to be…
The conjecture of Brown, Erd\H{o}s and S\'os from 1973 states that, for any $k \ge 3$, if a $3$-uniform hypergraph $H$ with $n$ vertices does not contain a set of $k+3$ vertices spanning at least $k$ edges then it has $o(n^2)$ edges. The…
We show that if $K$ is a knot in $S^3$ and $\Sigma$ is a bridge sphere for $K$ with high distance and $2n$ punctures, the number of perturbations of $K$ required to interchange the two balls bounded by $\Sigma$ via an isotopy is $n$. We…