Gutin, Gregory and Rafiey, Arash (2006) Multipartite tournaments with small number of cycles. Australasian Journal of Combinatorics, 34 (1).
Full text access: Open
Volkmann, Discrete Math. 45 (2002) 19-53, posed the following question. Let 4 be less than or equal to m be less than or equal to n. Are there strong n-partite tournaments, which are not themselves tournaments, with exactly n - m + 1 cycles of length m? We answer this question in the affirmative. We raise the following problem. Given m e {3, 4, ... n}, find a characterization of strong n-partite tournaments having exactly n - m + 1 cycles of length m.
This is a Submitted version This version's date is: 2006 This item is not peer reviewed
https://repository.royalholloway.ac.uk/items/8f1390ad-b99c-4155-f855-9cd3a65ca0a5/4/
Deposited by Research Information System (atira) on 27-Jan-2013 in Royal Holloway Research Online.Last modified on 27-Jan-2013
Royal Holloway Research Online is grateful to the Australasian Journal of Combinatorics for providing the published version of this paper for the purposes of private study or research.