Talks

See below for slides and recordings, and see my CV for a full list of talks. Also see the Graphs and Matroids seminar series for more recordings.

2025

• Vertex-minors and quantum computing. [slides]
  Bertinoro Workshop on Algorithms and Graphs, Italy.
  
• Preparing Graph States. [slides]
  Algorithms, Combinatorics, and Optimization Research Network (ACORN), Pittsburgh.
  
• The first-order logic of graphs. [slides]
  Tutte Colloquium, Waterloo.
  
• Graph theory tutorial. [slides]
  Workshop on Quantum Graph States, Arlington.
  
• Monadically stable graph classes. [slides]
  Oberwolfach Graph Theory workshop, Germany.
  
• Neighborhood complexity and matroids. [slides]
  LSU Combinatorics Seminar, online.
  

2024

• Colorings, graphs, and geometry. [slides]
  Willamette University Mathematics Colloquium, online.
  
• Prime distances in colorings of the plane. [slides]
  Combinatorial Mathematics Society of Australasia Seminar, online.
  
• Colorings of the plane cannot avoid prime distances. [slides]
  Shanks Workshop on Combinatorics and Graph Theory, Nashville.
  

2023

• Delta-boundedness. [slides]
  EUROCOMB, Prague.
  
• Structural graph theory and monadic stability. [slides]
  AMS Special Session on Logic, Combinatorics, and Their Interactions.
  

2022

• Average degree and girth. [slides]
  Discrete Math and Probability Seminar, Oxford.
• Local structure for vertex-minors. [LSU slides, Tulane slides]
  Combinatorics Seminar at LSU and Algebra and Combinatorics Seminar at Tulane.
• A combinatorial game for monadic stability. [slides]
  Workshop on Graph Theory and Combinatorics in Memory of Robin Thomas, Georgia Tech.
• Circuit decompositions of group-labelled graphs. [video]
  Jagiellonian Theoretical Computer Science Seminar, Kraków.
  

2021

• Vertex-minors and structure for dense graphs. [slides]
  Combinatorics Seminar, Georgia Tech.
• Representing graphs with sublinear separators. [slides, video]
  Banff Workshop on Graph Product Structure Theory, online.
• Average degree and bicliques. [slides]
  Combinatorics Seminar at the University of Birmingham, online.
• Conjectures for vertex-minors. [slides]
  Dagstuhl Seminar on Sparsity, online.
• Local structure for vertex-minors. [slides]
  Thesis defense talk, online.
• Connectivity for adjacency matrices and vertex-minors. [slides]
  CanaDAM, online.
• Vertex-minors and immersions. [slides]
  Princeton Discrete Math Seminar, online.
• Rank-width, circle graphs, and vertex-minors. [slides, video]
  Width Parameters (JCRAALMA), online.
• Vertex-minors and flooding immersions. [slides]
  IBS Virtual Discrete Math Colloquium, online.

2020 and earlier

• Colouring pseudo-visibility graphs. [slides, video]
  Matroid Union Seminar, online.
• Colouring visibility graphs. [slides]
  LSU Combinatorics Seminar and Bordeaux Graph Seminar.
• Unavoidable dense induced subgraphs. [slides, video]
  ISU Discrete Math Seminar and GA Tech Graph Theory Seminar.
• Vertex-minors and circle graphs. [slides]
  CMS Winter Meeting, Toronto.
• Colouring graphs with geometric origins. [slides]
  Waterloo Math Undergrad Research Conference, Waterloo.
• Decomposing a graph into odd trails. [slides]
  CanaDAM, Vancouver.
• Circle graphs are polynomially chi-bounded. [video]
  IBS/KAIST Discrete Math Seminar, Daejon.
• The grid theorem for rank-width. [slides]
  SIAM Discrete Math, Denver.
• 8-Connected graphs are 4-ordered. [slides, video]
  SiGMa, Waterloo.