Cornelius Brand talks about the complexity of counting small induced subgraphs, a topic he has not worked in, using slides that he has not seen before. A conversation with the authors ensues.
→ (external link, opens in a new window) Watch the talk in the UR Media Library
