Answers are grounded in this paper and cite their sources.
Analysis reveals existence of kernels in tournaments allowing up to three colours, indicating novel substructure flexibility.
In this paper we prove the existence of kernels by monochromatic paths in m-coloured tournaments in which every cyclic tournament of order 3 is atmost 2-coloured in addition to other restrictions on the colouring ofcertain subdigraphs. We point out that in all previous results on kernelsby monochromatic paths in arc coloured tournaments, certain smallsubstructures are required to be monochromatic or monochromatic with atmost one exception, whereas here we allow up to three colours in two smallsubstructures.
No takes yet. Share an insight, caveat, or question.
Galeana‐Sánchez et al. (2012) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: