Tait's conjecture on minimal crossing diagrams of links

Let LL be a link. A diagram of LL is reduced alternating if it is alternating and has no nugatory crossings. The crossing number of LL is the minimum number of crossings among all diagrams of LL.

Tait's conjecture. A reduced alternating diagram of LL has minimal crossing number, and if LL is prime then no non-alternating diagram has minimal crossing number.

This conjecture initiated the study of minimal crossing diagrams of links and was proved independently by Thistlethwaite, Kauffman, and Murasugi in 1987.

Sources & referencesView supporting material

Primary source

Erica Flapan and Hugh Howards, “Minimal crossing diagrams of spatial graphs”, arXiv:2511.09712 (2025).

Additional references

3 papers in this index state this conjecture (2007–2025). The statement above is taken from the most recent of them; the others are arXiv:1107.0378, arXiv:0704.1941.

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.