• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site

Article

A lower bound on the size of an absorbing set in an arc-coloured tournament

Discrete Mathematics. 2019. Vol. 342. No. 1. P. 143-144.
Beaudou L., Devroye L., Hahn G.

Bousquet, Lochet and Thomassé recently gave an elegant proof that for any integer n, there is a least integer f(n) such that any tournament whose arcs are coloured with n colours contains a subset S of vertices of size f(n) with the property that any vertex not in S admits a monochromatic path to some vertex of S. In this note we provide a lower bound on the value f(n).