A complete solution of a problem of Bondy concerning multipartite tournaments (Q1907115): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jctb.1996.0010 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2071843771 / rank | |||
Normal rank | |||
Latest revision as of 02:30, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A complete solution of a problem of Bondy concerning multipartite tournaments |
scientific article |
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
