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.
Original language | English (US) |
---|---|
Pages (from-to) | 1-20 |
Number of pages | 20 |
Journal | Journal of Combinatorial Theory. Series B |
Volume | 103 |
Issue number | 1 |
DOIs | |
State | Published - Jan 2013 |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics
Keywords
- Colouring
- Erdos-Hajnal conjecture
- Tournament
- Transitive