Upcoming: 

• Induced subgraphs and treewidth, WinCom Conference (slides). 

Recent(ish) past talks: 

• Induced subgraphs and treewidth,  SIAM DM, July 10, 2024 (slides). 

• Induced subgraphs and treewidth,  BIRS Workshop on Cross-Community Collaborations in Combinatorics, Banff, June 26, 2024 (slides). 

• Induced subgraphs and treewidth, Atlantic Graph Theory Seminar, March 7, 2024 (slides). 

• Odd cycle transversal in P5-free graphs, University of Waterloo Graphs and Matroids Seminar, February 13, 2024 (slides). 

• 2-colouring tournaments, Unfinished workshop, November 6, 2023 (slides).

• The Kromatic Symmetric Function, University of Waterloo Algebraic Combinatrics Seminar, August 17, 2023 (slides).

• Chi-boundedness and eta-boundedness, AMS Spring 2023 Eastern Sectional Meeting, April 1, 2023 (slides).

• Chi-boundedness and eta-boundedness, Sparse graphs coalition, March 28, 2023 (slides). 

• The Kromatic Symmetric Function,  MSU Combinatorics and Graph Theory Seminar, March 1, 2023 (slides). 

• Chi-boundedness and eta-boundedness, Western University, London, Ontario, February 8, 2023 (slides). 

• Induced subgraphs and treewidth: H-free graphs, Jagiellonian TCS Seminar, November 25, 2022 (slides). 

• Cops and Robbers (outreach), Experiencing Math and Computer Science, August 3, 2022 (slides). 

• Graph Width Parameters: from Structure to Algorithms, Satellite Workshop of ICALP 2022, July 4, 2022 (slides).

• Graph decompositions and the chromatic symmetric function, AMS 2022 Spring Western Sectional Meeting, May 15, 2022 (slides). 

• Chi-boundedness in graphs and digraphs, Ontario Combinatorics Workshop, May 13, 2022 (in person)

• Counterexamples for chromatic and dichromatic number, SCMS Combinatorics Seminar, May 5/6, 2022 (slides). 

• A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number, Birmingham Combinatorics Seminar, March 31, 2022 (slides). 

• A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number, Princeton Discrete Math Seminar, March 17, 2022 (slides).

• A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number, BBC + G Seminar, Budapest, February 25, 2022 (slides). 

• Two counterexamples related to chi-boundedness (joint talk with James Davies), Graphs and Matroids Seminar, University of Waterloo, February 8, 2022 (slides). 

• New results on polynomial chi-boundedness, Copenhagen-Jerusalem Combinatorics Seminar, online, January 13, 2022 (slides). 

• New results on polynomial chi-boundedness, CMS Winter Meeting, Graph Theory and its Applications, online, December 6, 2021 (slides). 

• New results on polynomial chi-boundedness, Graduate Research Seminar, online, University of Waterloo, November 15, 2021 (slides). 

• New results on polynomial chi-boundedness, DIMAP Seminar, Warwick, online, November 8, 2021 (slides). 

• • Modular relations for the Tutte symmetric function, Algebraic and Combinatorial Perspectives in the Mathematical Sciences, online, October 22, 2021 (slides).

  • Logarithmic treewidth, BIRS Workshop on New Perspectives in Colouring and Structure, online, October 22, 2021 (slides). 

  • Induced subgraphs and treewidth, New York Combinatorics Seminar, online, October 15, 2021 (slides).

  • Induced subgraphs and treewidth, Tutte Colloquium, University of Waterloo, online, October 8, 2021 (slides). 

  • Induced subgraphs and treewidth, Georgia Tech Graph Theory Seminar,  Atlanta, GA, online, September 14, 2021 (slides)

  • The complexity of list-5-colouring with a forbidden induced subgraph, SFU Discrete Math Seminar, Vancouver, BC, online, July 21, 2021 (slides)

  • Excluding a tree and a biclique, British Combinatorial Conference, Durham, UK, July 5-9 2021

  • Excluding a tree and a biclique, CanaDAM 2021, Minisymposium on Structural Graph Theory, online, May 25-28 2021

  • The complexity of list-5-colouring H-free graphs, Graphs and Matroids Seminar, University of Waterloo, May 10, 2021 (slides)

  • Pure pairs in ordered graphs, DIMAG (IBS) Virtual Discrete Math Colloquium, March 31/April 1, 2021 (depending on time zone) (slides)

  • The Erdos-Hajnal conjecture for graphs with no five-cycle, London School of Economics CGO Seminar, March 11, 2021 (slides)

  • The Erdos-Hajnal conjecture for graphs with no five-cycle, CMSA seminar, March 2/3, 2021 (depending on time zone) (slides)

  • The Erdos-Hajnal conjecture for graphs with no five-cycle, Princeton University Discrete Math Seminar, February 11, 2021 (slides)

  • The Erdos-Hajnal conjecture for graphs with no five-cycle, University of Victoria Discrete Math Seminar, January 14, 2021 (slides)

  • A complete multipartite basis for the chromatic symmetric function, CMS Winter Meeting (Algebraic Combinatorixx), Montreal, December 4, 2020 (slides)

  • Colouring graphs with a forbidden induced subgraph, Waterloo Graduate Student Seminar, November 25, 2020 (slides)

  • k-coloring graphs with a forbidden induced subgraph, Facets of Complexity RTG, Berlin, October 26, 2020 (slides)

  • Pure pairs, Tutte Colloquium, University of Waterloo, August 28, 2020 (slides)

  • A graph-based introduction to the chromatic symmetric function, Graphs and Matroids Seminar, University of Waterloo, August 17, 2020 (slides)

  • Pure pairs, Discrete Math 2-Day, Albany, April 25-26, 2020

  • Pure pairs, Women in Combinatorics Colloquium, May 21, 2020 (slides) 

  • Coloring Graphs with a Forbidden Induced Subgraph, Workshop and School on Algorithms and Complexity, Rutgers University, July 15-16, 2019

  • P6-free triangle-free graphs, 17w5154: Geometric and Structural Graph Theory, Banff International Research Station, August 24, 2017

  • Triangle-free graphs with no induced subdivision of K4 are 3-colorable, SiGMa, University of Waterloo, July 17-21, 2017

Some of the slides are stored on Google Drive, and you can access the folder here.