Bhargav C S talks about the fascinating problem of telling two graphs apart by counting homomorphisms, a topic he has not worked in, using slides that he has not seen before. A conversation with the author Tim Seppelt ensues.
→ (external link, opens in a new window) Watch the talk in the UR Media Library
