The falsity of the reconstruction conjecture for tournaments
Paul K. Stockmeyer · Journal of Graph Theory · 1977
Abstract The conjecture that for all sufficiently large p any tournament of order p is uniquely reconstructable from its point‐deleted subtournaments is shown to be false. Counterexamples are presented for all orders of the form 2n + 1 and 2n + 2. The largest previously known counterexamples were of order 8.