A Superlocal Version of Reed's Conjecture

Electronic Journal Of Combinatorics

Katherine Edwards¹ 

关键词: graph theory;    graph colouring;    Reed';    s Conjecture;    fractional colouring;   

DOI  :  

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

来源: Electronic Journal Of Combinatorics

【 摘 要 】

Reed's well-known $\omega$, $\Delta$, $\chi$ conjecture proposes that every graph satisfies $\chi \leq \lceil \frac 12(\Delta+1+\omega)\rceil$. The second author formulated a local strengthening of this conjecture that considers a bound supplied by the ne

【 授权许可】

Others