image/svg+xml Follow

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 ...
settheory.mathtalks.org/zoltan

Sign in to participate in the conversation
Scholar Social

Scholar Social is a microblogging platform for researchers, grad students, librarians, archivists, undergrads, academically inclined high schoolers, educators of all levels, journal editors, research assistants, professors, administrators—anyone involved in academia who is willing to engage with others respectfully. Read more ...