Y. Boudabbous et A. Boussairi, TOURNAMENTS RECONSTRUCTION AND DUALITY, Comptes rendus de l'Academie des sciences. Serie 1, Mathematique, 320(4), 1995, pp. 397-400
In [18], P. K. Stockmeyer proved that generally tournaments are not re
constructible in the sense of Ulam [19]. In this Note, our study will
be limited to the particular case of tournaments defined on a set of n
elements and for which every restriction of cardinality n - 3 is deco
mposable under lexicographical sum.