Upcoming talks

• 2nd February 2026 - Tung Nguyen (University of Oxford)

  Polynomial $\chi$-boundedness for excluding $P_5$

  
  

  We discuss some ideas behind the recent resolution of a 1985 open problem of Gyárfás, that there is a positive integer $k$ for which every graph with no induced five-vertex path has chromatic number at most the $k$th power of their clique number.

  
  
  

• 9th February 2026 - Matija Bucic (University of Vienna)

  Equiangular lines

  
  
  
  
  

• 23rd February 2026 - Jeck Lim (University of Oxford)

  (Title TBA)

  
  
  
  
  

• 2nd March 2026 - Laura Johnson (University of Bristol)

  (Title TBA)

  
  
  
  
  

• 9th March 2026 - Joanna Lada (London School of Economics)

  (Title TBA)

  
  
  
  
  

• 16th March 2026 - Richard Montgomery (University of Warwick)

  (Title TBA)