A lower bound on the size of an absorbing set in an arc-coloured tournament |
| |
Authors: | L. Beaudou L. Devroye G. Hahn |
| |
Abstract: | Bousquet, Lochet and Thomassé recently gave an elegant proof that for any integer , there is a least integer such that any tournament whose arcs are coloured with colours contains a subset of vertices of size with the property that any vertex not in admits a monochromatic path to some vertex of . In this note we provide a lower bound on the value . |
| |
Keywords: | Corresponding author. Probabilistic method Arc-coloured tournament |
本文献已被 ScienceDirect 等数据库收录! |