A larger class of reconstructible tournaments (Q1917492): Difference between revisions

Let \(T_n\) denote a strong tournament with \(n\geq 4\) nodes whose simple quotient is normal. The author shows that, apart from three exceptions, such a tournament can be reconstructed from its subtournaments of size \(n- 1\).