Triplewhist tournaments with the three person property (Q2459497): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jcta.2007.01.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2034838607 / rank
 
Normal rank

Revision as of 21:34, 19 March 2024

scientific article
Language Label Description Also known as
English
Triplewhist tournaments with the three person property
scientific article

    Statements

    Triplewhist tournaments with the three person property (English)
    0 references
    0 references
    7 November 2007
    0 references
    A triplewhist tournament for \(v=4n\) (\(4n+1\), resp.) with the three person property 3PTWh\((v)\) is a schedule of games for four players \((a,b,c,d)\), where \(\{a,c\}\) and \(\{b,d\}\) are partners, \(\{a,b\}\) and \(\{c,d\}\) are opponents of the first kind and \(\{a,d\}\) and \(\{b,c\}\) are opponents of the second kind, such that: (i) the games are arranged in \(4n-1\) (\(4n+1\), resp.) rounds each of \(n\) games; (ii) each player plays in exactly one game in each round (all rounds but one, resp.); (iii) each player is an opponent of the first (second, resp.) kind exactly once with each other player; (iv) any two games do not have three common players. In the paper under review, the author proves that that the necessary existence conditions \(v \geq 8\) and \(v \equiv 0,1 \pmod{4}\) for a 3PTWh\((v)\) are also sufficient except for \(v=9,12,13\) and possibly for \(v=17\). The constructions are direct and recursive depending on \(v\).
    0 references
    triplewhist tournament
    0 references
    three person property
    0 references
    necessary conditions
    0 references
    constructions
    0 references

    Identifiers