Date and Time: Wednesday, November 19, 3.40 pm Atlantic time Speaker: Rachel Kirsch, George Mason University Title: Maximizing subgraph density by double counting Abstract: This talk will highlight the use of the method of counting in two ways in recent research on maximizing subgraph density in graphs of bounded degree and clique number. Zoom link: https://us02web.zoom.us/j/88013261876?pwd=XGocyHqvseXY8metPztPoSuulEEejX.1 Meeting ID: 880 1326 1876 Passcode: 357963