Induced subgraphs of graphs with large chromatic number. IV. Consecutive holes

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.

Manylion Llyfryddiaeth
Prif Awduron:	Scott, A, Seymour, P
Fformat:	Journal article
Cyhoeddwyd:	Elsevier 2018

Eitemau Tebyg

Induced subgraphs of graphs with large chromatic number. I. Odd holes
gan: Scott, A, et al.
Cyhoeddwyd: (2015)

Induced subgraphs of graphs with large chromatic number. III. Long holes
gan: Chudnovsky, M, et al.
Cyhoeddwyd: (2016)

Induced subgraphs of graphs with large chromatic number. X. Holes of specific residue
gan: Scott, A, et al.
Cyhoeddwyd: (2019)

Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes
gan: Chudnovsky, M, et al.
Cyhoeddwyd: (2019)

Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes
gan: Chudnovsky, M, et al.
Cyhoeddwyd: (2019)

Induced subgraphs of graphs with large chromatic number. XI. orientations
gan: Chudnovsky, M, et al.
Cyhoeddwyd: (2018)

Induced subgraphs of graphs with large chromatic number IX: rainbow paths
gan: Scott, A, et al.
Cyhoeddwyd: (2017)

Induced subgraphs of graphs with large chromatic number. VI. Banana trees
gan: Scott, A, et al.
Cyhoeddwyd: (2020)

Induced subgraphs of graphs with large chromatic number. XIII. New brooms
gan: Scott, A, et al.
Cyhoeddwyd: (2019)

Induced subgraphs of graphs with large chromatic number. XII. Distant stars
gan: Chudnovsky, M, et al.
Cyhoeddwyd: (2019)

Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings
gan: Chudnovsky, M, et al.
Cyhoeddwyd: (2021)

Induced subgraphs of graphs with large chromatic number. VII. Gyárfás' complementation conjecture
gan: Scott, A, et al.
Cyhoeddwyd: (2020)

Induced subgraphs of induced subgraphs of large chromatic number
gan: Girao, A, et al.
Cyhoeddwyd: (2023)

Induced subgraphs of graphs with large chromatic number. II. Three steps towards Gyarfas' conjectures
gan: Chudnovsky, M, et al.
Cyhoeddwyd: (2016)

Polynomial bounds for chromatic number VII. Disjoint holes
gan: Chudnovsky, M, et al.
Cyhoeddwyd: (2023)

Maximising the number of cycles in graphs with forbidden subgraphs
gan: Morrison, N, et al.
Cyhoeddwyd: (2020)

Polynomial bounds for chromatic number. iv: a near-polynomial bound for excluding the five-vertex path
gan: Scott, A, et al.
Cyhoeddwyd: (2023)

Polynomial bounds for chromatic number VIII. Excluding a path and a complete multipartite graph
gan: Nguyen, T, et al.
Cyhoeddwyd: (2024)

Polynomial bounds for chromatic number VIII. Excluding a path and a complete multipartite graph
gan: Nguyen, T, et al.
Cyhoeddwyd: (2024)

Polynomial bounds for chromatic number. I: excluding a biclique and an induced tree
gan: Scott, A, et al.
Cyhoeddwyd: (2022)

Cohesive subgraph mining in large graphs
gan: Yu, Kaiqiang
Cyhoeddwyd: (2023)

Polynomial bounds for chromatic number. V. Excluding a tree of radius two and a complete multipartite graph
gan: Scott, A, et al.
Cyhoeddwyd: (2023)

The chromatic number of dense random graphs
gan: Heckel, A
Cyhoeddwyd: (2018)

Chromatic Equivalence Classes and Chromatic Defining Numbers of Certain Graphs
gan: Omoomi, Behnaz
Cyhoeddwyd: (2001)

The t-improper chromatic number of random graphs
gan: Kang, R, et al.
Cyhoeddwyd: (2008)

On the chromatic number of random Cayley graphs
gan: Green, B
Cyhoeddwyd: (2016)

The t-Improper Chromatic Number of Random Graphs
gan: Kang, R, et al.
Cyhoeddwyd: (2010)

On the chromatic number of random geometric graphs
gan: McDiarmid, C, et al.
Cyhoeddwyd: (2011)

On the chromatic number of random geometric graphs
gan: McDiarmid, C, et al.
Cyhoeddwyd: (2011)

The incidence chromatic number of some graph
gan: Liu Xikui, et al.
Cyhoeddwyd: (2005-01-01)

The Locating Chromatic Number of Book Graph
gan: Nur Inayah, et al.
Cyhoeddwyd: (2021-01-01)

Dynamic Chromatic Number of Bipartite Graphs
gan: S. Saqaeeyan, et al.
Cyhoeddwyd: (2016-12-01)

The b-chromatic number of power graphs
gan: Brice Effantin, et al.
Cyhoeddwyd: (2003-01-01)

On the chromatic number of some flip graphs
gan: Ruy Fabila-Monroy, et al.
Cyhoeddwyd: (2009-01-01)

Distance graphs with maximum chromatic number
gan: Javier Barajas, et al.
Cyhoeddwyd: (2005-01-01)

Large Induced Subgraphs with All Degrees Odd
gan: Scott, A
Cyhoeddwyd: (1992)

An upper bound for the chromatic number of line graphs
gan: Andrew D. King, et al.
Cyhoeddwyd: (2005-01-01)

On local antimagic chromatic number of spider graphs
gan: Lau, Gee-Choon, et al.
Cyhoeddwyd: (2022)

On the δ-chromatic numbers of the Cartesian products of graphs
gan: Tangjai Wipawee, et al.
Cyhoeddwyd: (2024-11-01)

On the Locating Chromatic Number of Certain Barbell Graphs
gan: Asmiati, et al.
Cyhoeddwyd: (2018-01-01)