|
|
|
|
| LEADER |
01274 am a22002653u 4500 |
| 001 |
99446 |
| 042 |
|
|
|a dc
|
| 100 |
1 |
0 |
|a Berger, Eli
|e author
|
| 100 |
1 |
0 |
|a Massachusetts Institute of Technology. Department of Mathematics
|e contributor
|
| 100 |
1 |
0 |
|a Fox, Jacob
|e contributor
|
| 700 |
1 |
0 |
|a Choromanski, Krzysztof
|e author
|
| 700 |
1 |
0 |
|a Chudnovsky, Maria
|e author
|
| 700 |
1 |
0 |
|a Fox, Jacob
|e author
|
| 700 |
1 |
0 |
|a Loebl, Martin
|e author
|
| 700 |
1 |
0 |
|a Scott, Alex
|e author
|
| 700 |
1 |
0 |
|a Seymour, Paul
|e author
|
| 700 |
1 |
0 |
|a Thomasse, Stephan
|e author
|
| 245 |
0 |
0 |
|a Tournaments and colouring
|
| 260 |
|
|
|b Elsevier,
|c 2015-10-26T12:04:11Z.
|
| 856 |
|
|
|z Get fulltext
|u http://hdl.handle.net/1721.1/99446
|
| 520 |
|
|
|a 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.
|
| 520 |
|
|
|a Simons Foundation (Fellowship)
|
| 546 |
|
|
|a en_US
|
| 655 |
7 |
|
|a Article
|
| 773 |
|
|
|t Journal of Combinatorial Theory, Series B
|
