4-正则图的Tait飞行猜想
Tait's Flyping Conjecture for 4-Regular Graphs
摘要：
Tait的苍蝇猜想，指出两个约化的，交替的，素连接图可以连接由一个有限序列的苍蝇，被推广到约化的，交替的，素图的4-正则图在S ^3。这个版本的flyping猜想的证明是基于这样一个事实，即关于图嵌入的环境合痕和刚性顶点合痕的等价类在所考虑的图类上是相同的。
英文摘要：
Tait's flyping conjecture, stating that two reduced, alternating, prime link diagrams can be connected by a finite sequence of flypes, is extended to reduced, alternating, prime diagrams of 4-regular graphs in S^3. The proof of this version of the flyping conjecture is based on the fact that the equivalence classes with respect to ambient isotopy and rigid vertex isotopy of graph embeddings are identical on the class of diagrams considered.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
