Tait's flyping conjecture for well-connected links (Q1325274): Difference between revisions

The author calls a link diagram well-connected if it is connected and has no non-trivial 2-edge or 4-edge cuts. In this paper Tait's flyping conjecture is carefully proved for alternating well-connected link diagrams. The Tait flyping conjecture [\textit{P. G. Tait}, Trans. R. Soc. Edinb. 28, 145-190 (1877; JFM 09.0392.09)], that so-called reduced diagrams of equivalent links are related by certain simple operations has been proved (as the author points out) by \textit{W. W. Menasco} and \textit{M. B. Thistlethwaite} [Bull. Am. Math. Soc., New Ser. 25, No. 2, 403-412 (1991; Zbl 0745.57002)].