Large cardinal characterizations via compactness for list colourings

Abstract

We investigate compactness properties with respect to list colouring, a certain form of graph colouring, with infinitely many colours. We introduce a new hierarchy of compactness cardinals, that also includes some well-established large cardinal notions, and use it to show that various types of large cardinals, including weakly compact, strongly compact, and $δ$-strongly compact cardinals, can be characterized in terms of compactness for list colouring. We also obtain lower bounds on the size of our newly introduced compactness cardinals.