Alternating diagrams of 4-regular graphs in 3-space (Q1296265): Difference between revisions

A polynomial invariant of imbedded graphs introduced by \textit{Y. Yokota} [Topology 35, No. 1, 77-87 (1996; Zbl 0858.05037)] and techniques concerning the calculation of the bracket polynomial developed by \textit{M. B. Thistlethwaite} [ibid. 26, 297-309 (1987; Zbl 0622.57003)] are used to establish the following generalization of a Tait Conjecture: If \(G\) is a 4-regular graph imbedded in \(\mathbb{R}^3\) and \(D\) is an \(n\)-crossing diagram of \(G\) that is alternating and reduced, then: (i) There is no diagram of \(G\) having fewer than \(n\) crossings; (ii) If \(D\) is prime, then every nonalternating diagram of \(G\) has more than \(n\) crossings.