scholarly journals Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings

2021 ◽  
Vol 150 ◽  
pp. 195-243
Author(s):  
Maria Chudnovsky ◽  
Alex Scott ◽  
Paul Seymour
2019 ◽  
Vol 76 ◽  
pp. 53-61 ◽  
Author(s):  
Maria Chudnovsky ◽  
Alex Scott ◽  
Paul Seymour

2020 ◽  
Vol 140 ◽  
pp. 84-97 ◽  
Author(s):  
Maria Chudnovsky ◽  
Alex Scott ◽  
Paul Seymour ◽  
Sophie Spirkl

10.37236/6768 ◽  
2017 ◽  
Vol 24 (2) ◽  
Author(s):  
Alex Scott ◽  
Paul Seymour

We prove that for all integers $\kappa, s\ge 0$ there exists $c$ with the following property. Let $G$ be a graph with clique number at most $\kappa$ and chromatic number more than $c$. Then for every vertex-colouring (not necessarily optimal) of $G$, some induced subgraph of $G$ is an $s$-vertex path, and all its vertices have different colours. This extends a recent result of Gyárfás and Sárközy (2016) who proved the same for graphs $G$ with $\kappa=2$ and girth at least five.


2019 ◽  
Vol 92 (3) ◽  
pp. 237-254 ◽  
Author(s):  
Maria Chudnovsky ◽  
Alex Scott ◽  
Paul Seymour

COMBINATORICA ◽  
2016 ◽  
Vol 37 (6) ◽  
pp. 1057-1072 ◽  
Author(s):  
Maria Chudnovsky ◽  
Alex Scott ◽  
Paul Seymour

Sign in / Sign up

Export Citation Format

Share Document