A short proof of a theorem of Reid and Parker on tournaments
type: Item
instance of: scholarly article
title: A short proof of a theorem of Reid and Parker on tournaments
zbMATH Open document ID: 0811.05028
DOI: 10.1007/BF02986686
published in: Graphs and Combinatorics
publication date: 1995-02-01T00:00:00Z
review text: \textit{K. B. Reid} and \textit{E. T. Parker} [Disproof of a conjecture of Erdős and Moser on tournaments, J. Comb. Theory 9, 225-238 (1970; Zbl 0204.246)] proved that if \(k \geq 5\) and \(n \geq 7 \cdot 2^{k - 4}\), then every tournament of order \(n\) contains a transitive subtournament of order \(k\). The author presents a shorter proof of this result.
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 716418
zbMATH Keywords: tournament
zbMATH Keywords: transitive subtournament
author: V. Neumann-Lara
reviewed by: Brian Alspach
MaRDI profile type: Publication
cites work: Q3097395
cites work: Q5509547
cites work: Disproof of a conjecture of Erdös and moser on tournaments
cites work: The Voting Problem
cites work: The 3 and 4-dichromatic tournaments of minimum order
full work available at URL: https://doi.org/10.1007/bf02986686
OpenAlex ID: W2004184279
Recommended article: On Reid conjecture of score sets for tournaments
Recommended article: Three supplements to Reid's theorem in multipartite tournaments
Recommended article: Two proofs of Bermond-Thomassen conjecture for regular tournaments
Recommended article: Short proofs of theorems of Nash-Williams and Tutte
Recommended article: Sur la (-k)-demi-reconstructibilité des tournois finis
Recommended article: Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree
Recommended article: Q4234712
Recommended article: Hoàng-Reed conjecture holds for tournaments
Recommended article: Landau's and Rado's theorems and partial tournaments
Recommended article: Q6134956
description: scientific article; zbMATH DE number 716418