A complete solution of a problem of Bondy concerning multipartite tournaments
type: Item
instance of: scholarly article
title: A complete solution of a problem of Bondy concerning multipartite tournaments
zbMATH Open document ID: 0837.05067
author: Yubao Guo
author: Lutz Volkmann
published in: Journal of Combinatorial Theory. Series B
publication date: 1996-04-23T00:00:00Z
review text: An \(n\)-partite tournament is an orientation of a complete \(n\)-partite graph. In 1976, Bondy raised the following problem: does every strong \(n\)-partite \((n \geq 5)\) tournament, with at least two vertices in each partite set, contain an \((n + 1)\)-cycle? A negative answer to this question was obtained by the reviewer in 1982 and, independently, by R. Balakrishnan and P. Paulraja in 1984. The purpose of this paper is to provide a characterization of all such \(n\)-partite tournaments without \((n + 1)\)-cycles.
reviewed by: G. Gutin
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 839139
zbMATH Keywords: problem of Bondy
zbMATH Keywords: tournament
MaRDI profile type: Publication
full work available at URL: jctb.1996.0010
OpenAlex ID: W2071843771
DOI: 10.1006/JCTB.1996.0010
description: scientific article; zbMATH DE number 839139