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.
Huvudupphovsmän: | Scott, A, Seymour, P |
---|---|
Materialtyp: | Journal article |
Publicerad: |
Elsevier
2018
|
Liknande verk
Liknande verk
-
Induced subgraphs of graphs with large chromatic number. I. Odd holes
av: Scott, A, et al.
Publicerad: (2015) -
Induced subgraphs of graphs with large chromatic number. III. Long holes
av: Chudnovsky, M, et al.
Publicerad: (2016) -
Induced subgraphs of graphs with large chromatic number. X. Holes of specific residue
av: Scott, A, et al.
Publicerad: (2019) -
Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes
av: Chudnovsky, M, et al.
Publicerad: (2019) -
Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes
av: Chudnovsky, M, et al.
Publicerad: (2019)