Coloring the vertices of a graph with measurable sets in a probability space

We introduce a class of “chromatic” graph parameters that includes the chromatic number, the circular chromatic number, the fractional chromatic number, and an uncountable horde of others. We prove some basic results about this class and pose some problems.