King-Serf Duo by Monochromatic Paths in $k$-Edge-Coloured Tournaments

Electronic Journal Of Combinatorics

Kristóf Bérczi¹ 

关键词: Kernel by monochromatic paths;    King-serf duo;    Infinite graph;    Tournament;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

An open conjecture of Erdős states that for every positive integer $k$ there is a (least) positive integer $f(k)$ so that whenever a tournament has its edges colored with $k$ colors, there exists a set $S$ of at most $f(k)$ vertices so that every vertex h

【 授权许可】

Others