Tait's Flyping Conjecture for 4-Regular Graphs
几何拓扑
2007-05-23 v2 组合数学
摘要
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.
引用
@article{arxiv.math/9806119,
title = {Tait's Flyping Conjecture for 4-Regular Graphs},
author = {J. Sawollek},
journal= {arXiv preprint arXiv:math/9806119},
year = {2007}
}
备注
20 pages, 13 figures, latex2e, metafont; main theorem generalized (without condition "vertex-separating"), to appear in JCTB