Zoltán Vidnyánszky: Borel chromatic numbers: finite vs infinite

KGRC Research Seminar - 2017-06-08 at 4pm. Speaker: Zoltán Vidnyánszky (York University, Toronto, Canada) Abstract: One of the most interesting results of Borel graph combinatorics is the $G_0$ dichotomy, i. e., the fact that a Borel graph has uncountable Borel chromatic number if and only if it contains a Borel homomorphic imag ...

https://settheory.mathtalks.org/zoltan-vidnyanszky-borel-chromatic-numbers-finite-vs-infinite/