Name
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. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.jctb.2012.08.003 | J. Comb. Theory, Ser. B |
Keywords | Field | DocType |
complete graph,tournaments h,tournament h,chromatic number,transitive subtournaments,tournament,transitive | Complete graph,Discrete mathematics,Tournament,Combinatorics,Chromatic scale,Existential quantification,HERO,Vertex (geometry),Erdős–Hajnal conjecture,Mathematics,Transitive relation | Journal |
Volume | Issue | ISSN |
103 | 1 | 0095-8956 |
Citations | PageRank | References |
10 | 1.37 | 2 |
Authors | ||
9 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Eli Berger | 1 | 182 | 52.72 |
| Krzysztof Choromanski | 2 | 124 | 23.56 |
| Maria Chudnovsky | 3 | 310 | 61.32 |
| Jacob Fox | 4 | 10 | 1.37 |
| Martin Loebl | 5 | 152 | 28.66 |
| Alex Scott | 6 | 251 | 40.93 |
| Paul Seymour | 7 | 378 | 58.75 |
| Stéphan Thomassé | 8 | 651 | 66.03 |
| j e fox | 9 | 10 | 1.37 |