Logic Seminar

David Chodounsky, Institute of Mathematics of the Czech Academy of Sciences

"Countable chromatic number of definable graphs via games"

We define games which characterize countable coloring numbers of analytic graphs on Polish spaces. These games can provide simple verification of the countable chromatic number of certain graphs. (Eg. the rational distance graph on the Euclidean plane.) Joint work with Jindrich Zapletal.