摘要
Let Tn denote an n-tournament. According to L. Lovász, Tn is called k-P if any of its subtournaments induced by n + 1-κ vertices in Tn has the property P, where P denotes an invariant property of tournaments, either strong, or reducible. Tn is called exactly k-P if it is k-P but not （k + 1）-P. Particularly, I-P Tn is equivalent to P. Exactly 1-P Tn is called P briefly. Let R-（r1, r2,…, rn） be the score vector of Tn, r1≤r2≤…≤rn. The set of
