On Subtournaments of a Tournament

Abstract

Beineke and Harary [l] recently showed that the maximum number of strong tournaments with k nodes that can be contained in a tournament with n nodes isif 3 ≤ k ≤ n. The object of this note is to obtain some additional results of this type. We will use essentially the same terminology as was used in [ l ], so we will not repeat the standard definitions here.