Erratum to: “The falsity of the reconstruction conjecture for tournaments”
Paul K. Stockmeyer · Journal of Graph Theory · 2009
It has been brought to my attention by Ramachandran that there is an error in the proof of Theorem 1 in my paper [1].The theorem is true-the pairs of vertex-deleted tournaments are isomorphic-but the description of the isomorphism is incorrect.The number r i should not be the remainder of i modulo 2 p i +1 as stated, but rather the number in the range 1, . . ., 2 p i +1 that is congruent to i modulo 2 p i +1 .In other words, r i = ((i -1) mod 2 p i +1 )+1.With this revised definition, the phrase "(reducing modulo 2 p if necessary)" becomes superfluous and should be omitted.In Table 1, the entries r 4 and r 8 should both be 4, not 0.Kocay [2] has also pointed out that the original isomorphism description was incorrect, and provided an alternative proof of the theorem.His existence proof avoids the construction of explicit expressions for the isomorphisms.Finally, there is a typographical error in line 18 on page 22: the equation "pow( ji) = p j " should read "pow( j -i ) = p j ".