Tournaments and colouring
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 t...
Main Authors: | Berger, Eli (Author), Choromanski, Krzysztof (Author), Chudnovsky, Maria (Author), Fox, Jacob (Contributor), Loebl, Martin (Author), Scott, Alex (Author), Seymour, Paul (Author), Thomasse, Stephan (Author) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Mathematics (Contributor) |
Format: | Article |
Language: | English |
Published: |
Elsevier,
2015-10-26T12:04:11Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Tournaments With Forbidden Substructures and the Erdos-Hajnal Conjecture
by: Choromanski, Krzysztof
Published: (2013) -
Dynamic tournaments with uncertain length: applicability of the tournament model in promotional tournaments.
Published: (1997) -
On scores in tournaments
by: Naikoo T. A.
Published: (2018-12-01) -
The nature of tournaments
by: Holden, Richard T., et al.
Published: (2016) -
The Windsor Tournament
by: Marcus, John Michael
Published: (1975)