Tournaments and colouring

@article{Berger2013TournamentsAC,
  title={Tournaments and colouring},
  author={Eli Berger and Krzysztof Choromanski and Maria Chudnovsky and Jacob Fox and Martin Loebl and Alex D. Scott and Paul D. Seymour and St{\'e}phan Thomass{\'e}},
  journal={J. Comb. Theory, Ser. B},
  year={2013},
  volume={103},
  pages={1-20}
}
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. 

From This Paper

Topics from this paper.
21 Citations
4 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-4 of 4 references

The voting problem

  • R. Stearns
  • Amer. Math. Monthly
  • 1959
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…