A characterization of unique tournaments (Q1386429): 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.1997.1799 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2082549494 / rank | |||
Normal rank | |||
Revision as of 00:41, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A characterization of unique tournaments |
scientific article |
Statements
A characterization of unique tournaments (English)
0 references
26 November 1998
0 references
The author uses results of \textit{V. Müller}, \textit{J. Nešetřil} and \textit{J. Pelant} [Discrete Math. 11, 37-66 (1975; Zbl 0301.05114)] to deduce that there are exactly four strong tournaments that are determined up to isomorphism by their score sequences. Reviewer's remark: A direct proof of this result was given by \textit{P. Avery} [J. Graph Theory 4, 157-164 (1980; Zbl 0403.05045)].
0 references
tournaments
0 references
score sequences
0 references
