Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes
Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes
复制标题
DOI：
10.1016/j.jctb.2019.05.001
复制
发表时间：
2017-01
期刊：
影响因子：
--
通讯作者：
M. Chudnovsky;A. Scott;P. Seymour;S. Spirkl
中科院分区：
文献类型：
--
作者：
M. Chudnovsky;A. Scott;P. Seymour;S. Spirkl
本文证明了AndrásGyárfás的一个猜想：对任意的图κ，λ，每个团数不超过κ且色数足够大的图都有一个长度不小于λ的奇洞.
We prove a conjecture of András Gyárfás, that for all κ, ℓ, every graph with clique number at most κ and sufficiently large chromatic number has an odd hole of length at least ℓ.