Induced subgraphs of graphs with large chromatic number. IV. Consecutive holes
A hole in a graph is an induced subgraph which is a cycle of length at least four. We prove that for all ν > 0, every triangle-free graph with sufficiently large chromatic number contains holes of ν consecutive lengths.
主要な著者: | Scott, A, Seymour, P |
---|---|
フォーマット: | Journal article |
出版事項: |
Elsevier
2018
|
類似資料
-
Induced subgraphs of graphs with large chromatic number. I. Odd holes
著者:: Scott, A, 等
出版事項: (2015) -
Induced subgraphs of graphs with large chromatic number. III. Long holes
著者:: Chudnovsky, M, 等
出版事項: (2016) -
Induced subgraphs of graphs with large chromatic number. X. Holes of specific residue
著者:: Scott, A, 等
出版事項: (2019) -
Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes
著者:: Chudnovsky, M, 等
出版事項: (2019) -
Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes
著者:: Chudnovsky, M, 等
出版事項: (2019)