A short proof of a theorem of Reid and Parker on tournaments (Q1343229)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A short proof of a theorem of Reid and Parker on tournaments
scientific article

    Statements

    A short proof of a theorem of Reid and Parker on tournaments (English)
    0 references
    0 references
    1 February 1995
    0 references
    \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.
    0 references
    0 references
    tournament
    0 references
    transitive subtournament
    0 references
    0 references
    0 references