Tournaments and colouring - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Combinatorial Theory, Series B Année : 2013

Tournaments and colouring

Résumé

A tournament is a complete graph with its edges directed, and colouring a tournament means partitioning its vertex set into transitive subtournaments. For some tournaments H there exists c such that every tournament not containing H as a subtournament has chromatic number at most c (we call such a tournament H a hero); for instance, all tournaments with at most four vertices are heroes. In this paper we explicitly describe all heroes.
Fichier principal
Vignette du fichier
tourcol.pdf (302.05 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04639113 , version 1 (09-07-2024)

Identifiants

Citer

Eli Berger, Krzysztof Choromanski, Maria Chudnovsky, Jacob Fox, Martin Loebl, et al.. Tournaments and colouring. Journal of Combinatorial Theory, Series B, 2013, 103 (1), pp.1-20. ⟨10.1016/j.jctb.2012.08.003⟩. ⟨hal-04639113⟩
0 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More