Games for chromatic numbers of analytic graphs

Speaker(s)

David Chodounsky

Affiliation

Institute of Mathematics of the Czech Academy of Sciences

Date

Nov. 8, 2023, 4:15 p.m.

Room

room 5050

Seminar

Topology and Set Theory Seminar

---

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. We also get a simpler proof of a dichotomy originally proved by Adams and Zapletal: if an analytic graph has an uncountable color number, then it contains a certain subgraph. Joint work with Jindrich Zapletal.

---

• file