Charles Explorer logo
🇨🇿

Tournaments and colouring

Publikace na Matematicko-fyzikální fakulta |
2013

Tento text není v aktuálním jazyce dostupný. Zobrazuje se verze "en".Abstrakt

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.