On the characterizations of
arXiv:2508.07332
Abstract
The determinant of a tournament , denoted by , is defined as the determinant of the skew-adjacency matrix of . It is well-known that is equal to if is odd, and is the square of an odd integer if is even. For a positive odd integer , let be the set of tournaments whose all subtournaments have determinant at most . Former studies showed that for , a tournament ( when ) if and only if is switching equivalent to a transitive blowup of , where is a tournament of order with a specific structure. For , no characterization results are known. A natural problem is to characterize tournaments in that can be switching equivalent to a transitive blowup of for . To address this problem and to further explore the structural properties of tournaments in , we introduce CR tournaments, strong CR tournaments, basic tournaments and -matrices, and investigate their properties. We use these properties to characterize those tournaments where contains a subtournament switching isomorphic to a basic strong CR tournament in . This result implies former characterizations of and . Using -matrices, we also show that for even , is a basic strong CR tournament, and thus solve the open problem posed in [Discrete Math. 349 (2) (2026) 114766].
arXiv comment38 pages, 1 figure