Linear Bound for Majority Colourings of Digraphs

Electronic Journal Of Combinatorics

Fiachra Knox¹ 

关键词: Colourings;    Digraphs;   

DOI  :  

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

来源: Electronic Journal Of Combinatorics

【 摘 要 】

Given $\eta \in [0, 1]$, a colouring $C$ of $V(G)$ is an $\eta$-majority colouring if at most $\eta d^+(v)$ out-neighbours of $v$ have colour $C(v)$, for any $v \in V(G)$. We show that every digraph $G$ equipped with an assignment of lists $L$, each of si

【 授权许可】

Others