Sai Sandeep — d-to-1 hardness of coloring 3-colorable graphs with O(1) colors
Channel: Jakub Opršal
Date: 2021-01-22

This is a recording of Sai Sandeep's talk at the CSP online seminar. More detail can be found at:

https://csp-seminar.org/talks/sai-sandeep/