Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes

被引：8
|
作者：
Chudnovsky, Maria [1 ]
Scott, Alex [2 ]
Seymour, Paul [1 ]
Spirkl, Sophie [1 ,3 ]
机构：
[1] Princeton Univ, Princeton, NJ 08544 USA
[2] Univ Oxford, Math Inst, Oxford OX2 6GG, England
[3] Rutgers State Univ, New Brunswick, NJ 08901 USA
来源：
JOURNAL OF COMBINATORIAL THEORY SERIES B | 2020年 / 140卷
关键词：
D O I：
10.1016/j.jctb.2019.05.001
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We prove a conjecture of Andras Gyarfas, that for all kappa, l, every graph with clique number at most kappa and sufficiently large chromatic number has an odd hole of length at least l. (C) 2019 Elsevier Inc. All rights reserved.
引用
收藏
页码：84 / 97
页数：14
相关论文
共 50 条
12345