Mina Nahvi - Acyclic graphs with at least 2l + 1 vertices are l-recognizable

New channel GSCC 2021: title sample judged 'whole' (These are genuine research talks and tutorials from a graduate combinatorics conference, consistently technical and educ); passed a second screen for sellers/exam-prep/re-uploads; 1 of 3 sampled transcripts showed teaching, 1 not; titles picked one by one, checked strictly; oEmbed verified.

A 18-minute video from GSCC 2021: “Mina Nahvi - Acyclic graphs with at least 2l + 1 vertices are l-recognizable”.

Video by GSCC 2021, played through YouTube's embedded player.