A complete solution of a problem of Bondy concerning multipartite tournaments (Q1907115)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 839139
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A complete solution of a problem of Bondy concerning multipartite tournaments |
scientific article; zbMATH DE number 839139 |
Statements
A complete solution of a problem of Bondy concerning multipartite tournaments (English)
0 references
23 April 1996
0 references
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.
0 references
problem of Bondy
0 references
tournament
0 references
0.8686251640319824
0 references
0.856656014919281
0 references
0.8541442155838013
0 references
0.8541436791419983
0 references
