203 citations · 470 across the 96 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
math.CO2015
Induced subgraphs of graphs with large chromatic number. IV. Consecutive holes
Alex Scott, Paul Seymour
A hole in a graph is an induced subgraph which is a cycle of length at least four. We prove that for every positive integer k, every triangle-free graph with sufficiently large chr…
math.CO2015
Induced subgraphs of graphs with large chromatic number. III. Long holes
Maria Chudnovsky, Alex Scott, Paul Seymour
We prove a 1985 conjecture of Gyárfás that for all , every graph with sufficiently large chromatic number contains either a complete subgraph with vertices or an induce…
math.CO2015
On a problem of Erdos and Moser
Bela Bollobas, Alex Scott
A set of vertices in an -uniform hypergraph is covered in if there is some vertex such that, for every -set , the s…