Tournaments and colouring
Name
Fox_Tournaments and colouring.pdf
Size
320.4 KB
Format
Adobe PDF
Checksum (MD5)
ef934e36b28cc4060392dd899220ad4e
Author(s)
Berger, Eli
Choromanski, Krzysztof
Chudnovsky, Maria
Fox, Jacob
Loebl, Martin
Scott, Alex
Seymour, Paul
Thomasse, Stephan
Date Issued
August 2012
Journal
Journal of Combinatorial Theory, Series B
Publisher
Elsevier
Citation
Berger, Eli, Krzysztof Choromanski, Maria Chudnovsky, Jacob Fox, Martin Loebl, Alex Scott, Paul Seymour, and Stephan Thomasse. “Tournaments and Colouring.” Journal of Combinatorial Theory, Series B 103, no. 1 (January 2013): 1–20.
Version
Author's final manuscript
Abstract
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.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Creative Commons Attribution-Noncommercial-NoDerivatives
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1016/j.jctb.2012.08.003
