On Stockmeyer's non‐reconstructible tournaments
William Lawrence Kocay · Journal of Graph Theory · 1985
Abstract Stockmeyer (The falsity of the reconstruction conjecture for tournaments. J. Graph Theory, 1 (1977) 19–25) constructed an infinite family of non‐reconstructible tournaments. It has been known for some time that there is a flaw in the proof given there. We provide an alternative constructive proof which is much simpler than the original proof.