Skip to main content
To refer to this page use:
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. (C) 2012 Elsevier Inc. All rights reserved.
Publication Date: Jan-2013
Electronic Publication Date: 29-Aug-2012
Citation: Berger, Eli, Choromanski, Krzysztof, Chudnovsky, Maria, Fox, Jacob, Loebl, Martin, Scott, Alex, Seymour, Paul, Thomasse, Stephan. (2013). Tournaments and colouring. JOURNAL OF COMBINATORIAL THEORY SERIES B, 103 (1 - 20. doi:10.1016/j.jctb.2012.08.003
DOI: doi:10.1016/j.jctb.2012.08.003
ISSN: 0095-8956
EISSN: 1096-0902
Pages: 1 - 20
Type of Material: Journal Article
Version: Final published version. Article is made available in OAR by the publisher's permission or policy.

Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.