Toida's conjecture

In combinatorial mathematics, Toida's conjecture, due to Shunichi Toida in 1977, is a refinement of the disproven Ádám's conjecture from 1967.

Statement
Both conjectures concern circulant graphs. These are graphs defined from a positive integer $$n$$ and a set $$S$$ of positive integers. Their vertices can be identified with the numbers from 0 to $$n-1$$, and two vertices $$i$$ and $$j$$ are connected by an edge whenever their difference modulo $$n$$ belongs to set $$S$$. Every symmetry of the cyclic group of addition modulo $$n$$ gives rise to a symmetry of the $$n$$-vertex circulant graphs, and Ádám conjectured (incorrectly) that these are the only symmetries of the circulant graphs.

However, the known counterexamples to Ádám's conjecture involve sets $$S$$ in which some elements share non-trivial divisors with $$n$$. Toida's conjecture states that, when every member of $$S$$ is relatively prime to $$n$$, then the only symmetries of the circulant graph for $$n$$ and $$S$$ are symmetries coming from the underlying cyclic group.

Proofs
The conjecture was proven in the special case where n is a prime power by Klin and Poschel in 1978, and by Golfand, Najmark, and Poschel in 1984.

The conjecture was then fully proven by Muzychuk, Klin, and Poschel in 2001 by using Schur algebra, and simultaneously by Dobson and Morris in 2002 by using the classification of finite simple groups.