Correction to ``Knotted Hamiltonian cycles in spatial embeddings of complete graphs"
英文摘要：
We state and prove a correct version of a theorem presented in an earlier paper.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
相关论文
Knotted Hamiltonian cycles in linear embedding of $K_7$ into $\mathbb{R}^3$
In 1983 Conway and Gordon proved that any embedding of the complete graph $K_7$ into $\mathbb{R}^3$ contains at least one nontrivial knot as its Hamiltonian cycle. After their work knots (also links) are considered as intrinsic properties of abstract graphs, and numerous subsequent works have been continued until recently. In this paper we are interested in knotted Hamiltonian cycles in linear embedding of $K_7$. Concretely it is shown that any linear embedding of $K_7$ contains at most three figure-8 knots as its Hamiltonian cycles.
math.GT
Deleting an edge of a 3-cycle in an intrinsically knotted graph gives an intrinsically linked graph
We show that deleting an edge of a 3-cycle in an intrinsically knotted graph gives an intrinsically linked graph.
math.COmath.GT
A new intrinsically knotted graph with 22 edges
A graph is called intrinsically knotted if every embedding of the graph contains a knotted cycle. Johnson, Kidwell and Michael showed that intrinsically knotted graphs have at least 21 edges. Recently Lee, Kim, Lee and Oh, and, independently, Barsotti and Mattman, showed that $K_7$ and the 13 graphs obtained from $K_7$ by $\nabla Y$ moves are the only intrinsically knotted graphs with 21 edges. In this paper we present the following results: there are exactly three triangle-free intrinsically knotted graphs with 22 edges having at least two vertices of degree 5. Two are the cousins 94 and 110 …
math.GT
Bipartite intrinsically knotted graphs with 22 edges
A graph is intrinsically knotted if every embedding contains a knotted cycle. It is known that intrinsically knotted graphs have at least 21 edges and that the KS graphs, $K_7$ and the 13 graphs obtained from $K_7$ by $\nabla Y$ moves, are the only minor minimal intrinsically knotted graphs with 21 edges. This set includes exactly one bipartite graph, the Heawood graph. In this paper we classify the intrinsically knotted bipartite graphs with at most 22 edges. Previously known examples of intrinsically knotted graphs of size 22 were those with KS graph minor and the 168 graphs in the $K_{3,3,1…
math.GT
More intrinsically knotted graphs with 22 edges and the restoring method
A graph is called intrinsically knotted if every embedding of the graph contains a knotted cycle. Johnson, Kidwell and Michael, and, independently, Mattman showed that intrinsically knotted graphs have at least 21 edges. Recently Lee, Kim, Lee and Oh, and, independently, Barsotti and Mattman, showed that $K_7$ and the 13 graphs obtained from $K_7$ by $\nabla Y$ moves are the only intrinsically knotted graphs with 21 edges. Also Kim, Lee, Lee, Mattman and Oh showed that there are exactly three triangle-free intrinsically knotted graphs with 22 edges having at least two vertices of degree 5. Fur…
math.GT
Classification of Book Representations of $K_6$
A book representation of a graph is a particular way of embedding a graph in three dimensional space so that the vertices lie on a circle and the edges are chords on disjoint topological disks. We describe a set of operations on book representations that preserves ambient isotopy, and apply these operations to $K_6$, the complete graph with six vertices. We prove there are exactly 59 distinct book representations for $K_6$, and we identify the number and type of knotted and linked cycles in each representation. We show that book representations of $K_6$ contain between one and seven links, and…
math.GT
更多相关论文收起更多论文
Bipartite intrinsically knotted graphs with 23 edges
A graph is intrinsically knotted if every embedding contains a nontrivially knotted cycle. It is known that intrinsically knotted graphs have at least 21 edges and that there are exactly 14 intrinsically knotted graphs with 21 edges, in which the Heawood graph is the only bipartite graph. The authors showed that there are exactly two graphs with at most 22 edges that are minor minimal bipartite intrinsically knotted: the Heawood graph and Cousin 110 of the $E_9+e$ family. In this paper we show that there are exactly six bipartite intrinsically knotted graphs with 23 edges so that every vertex …
math.COmath.GT
Intrinsically Knotted and 4-Linked Directed Graphs
We consider intrinsic linking and knotting in the context of directed graphs. We construct an example of a directed graph that contains a consistently oriented knotted cycle in every embedding. We also construct examples of intrinsically 3-linked and 4-linked directed graphs. We introduce two operations, consistent edge contraction and H-cyclic subcontraction, as special cases of minors for digraphs, and show that the property of having a linkless embedding is closed under these operations. We analyze the relationship between the number of distinct knots and links in an undirected graph $G$ an…
math.COmath.GT
The algebra of knotted trivalent graphs and Turaev's shadow world
Knotted trivalent graphs (KTGs) form a rich algebra with a few simple operations: connected sum, unzip, and bubbling. With these operations, KTGs are generated by the unknotted tetrahedron and Moebius strips. Many previously known representations of knots, including knot diagrams and non-associative tangles, can be turned into KTG presentations in a natural way. Often two sequences of KTG operations produce the same output on all inputs. These `elementary' relations can be subtle: for instance, there is a planar algebra of KTGs with a distinguished cycle. Studying these relations naturally lea…
math.GTmath.QA
KnottedGraph：面向科学与数学发现的可扩展纽结图拓扑
KnottedGraph: Scalable knotted-graph topology for scientific and mathematical discovery
National University of Singapore（新加坡国立大学）
本文提出KnottedGraph框架，将科学数据转换为纽结图以同时保留连通性和空间嵌入，通过可扩展的Yamada多项式评估支持大规模拓扑分类，并利用LLM辅助从拓扑数据中发现闭式公式，实现AI4Math数学发现。
cs.CGcs.MScs.SC
Knots in the canonical book representation of complete graphs
We describe which knots can be obtained as cycles in the canonical book representation of K_n, the complete graph on n vertices. We show that the canonical book representation of K_n contains a Hamiltonian cycle that is a composite knot if and only if n>11 and we show that when p and q are relatively prime, the (p,q) torus knot is a Hamiltonian cycle in the canonical book representation of K_{2p+q}. Finally, we list the number and type of all non-trivial knots that occur as cycles in the canonical book representation of K_n for n<12. We conjecture that the canonical book representation of K_n …
math.GT
Hamiltonian Cycles in Polyhedral Maps
We present a necessary and sufficient condition for existence of a contractible, non-separating and noncontractible separating Hamiltonian cycle in the edge graph of polyhedral maps on surfaces. In particular, we show the existence of contractible Hamiltonian cycle in equivelar triangulated maps. We also present an algorithm to construct such cycles whenever it exists.
math.COmath.GT
作为立方图的高斯图：哈密顿环的选择至关重要
Gauss diagrams as cubic graphs: The choice of the Hamiltonian cycle matters
本研究探讨高斯图性质与哈密顿环选择的关联，构造了仅因环选择不同而可实现性不同、对应曲线不同的高斯图示例，并证明一类自然哈密顿环变换可保持其可实现性。
math.GNmath.GT
Contractible Hamiltonian Cycles in Polyhedral Maps
We present a necessary and sufficient condition for existence of a contractible Hamiltonian Cycle in the edge graph of equivelar maps on surfaces. We also present an algorithm to construct such cycles. This is further generalized and shown to hold for more general maps.
math.COmath.GT
Contractible Hamiltonian Cycles in Triangulated Surfaces
A triangulation of a surface is called $q$-equivelar if each of its vertices is incident with exactly $q$ triangles. In 1972 Altshuler had shown that an equivelar triangulation of torus has a Hamiltonian Circuit. Here we present a necessary and sufficient condition for existence of a contractible Hamiltonian Cycle in equivelar triangulation of a surface.
cs.CGmath.COmath.GT
Hamiltonian Cycle in Semi-Equivelar Maps on the Torus
Semi-Equivelar maps are generalizations of Archimedean solids to the surfaces other than 2-sphere. There are eight semi-equivelar maps of types $\{3^{3},4^{2}\}$, $\{3^{2},4,3,4\}$, $\{6,3,6,3\}$, $\{3^{4},6\}$, $\{4,8^{2}\}$, $\{3,12^{2}\}$, $\{4,6,12\}$, $\{6,4,3,4\}$ exist on the torus. In this article we show the existence of Hamiltonian cycle in each semi-equivelar map on the torus except the map of type $\{3,12^{2}\}$. This result gives the partial solution to the conjecture which is given by Gr$\ddot{u}$nbaum \cite{grunbaum} and Nash-Williams \cite{nash williams} that every 4-connected …
math.COmath.GT
