As things can get hard to find on the blog, I’ll be updating this post with links to our content from this year, after the fact.

For upcoming talks and a permanent link to this post, see the “Talks” page.

**Past online talks:**

- Jan 11: Stephan Kreutzer, Directed tangles
- Jan 18: Kazuhiro Nomoto – $I_t$-free, triangle-free binary matroids
- Jan 25: Liana Yepremyan – Ryser’s conjecture and more
- Feb 1: Meike Hatzel – Perfect Matching Width and a grid minor theorem for bipartite graphs
- Feb 8: David Wood – Hypergraph Colouring via Rosenfeld Counting
- Feb 22: Geoff Whittle, Monotone orders of connectivity functions
- Mar 1: O-joung Kwon, A unified half-integral Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups
- Mar 8: Nick Brettell, The excluded minors for 2-regular matroids, and for Hydra-5-representable matroids
- Mar 15: Ben Moore, A density bound for triangle-free 4-critical graphs
- Mar 22: Peter Nelson, Formalizing matroids
- Mar 29: Charles Semple, Matroids with wheel- and whirl-like properties
- Apr 5: Raphael Steiner, Directed graphs: Substructures and Coloring
- Apr 12: Daryl Funk – The class of bicircular matroids has only a finite number of excluded minors
- Apr 19: Daniel I. Bernstein – Rigidity of symmetry-forced frameworks
- May 10: Sophie Spirkl – The complexity of list-5-colouring of H-free graphs
- May 17: Bertrand Guenin – Graphs with the same even cycles
- May 31: Dan Slilaty – Orientations of golden-mean matroids
- Jun 7: Abhinav Shantanam – Pancyclicity in 4-connected planar graphs
- Jun 14: Youngho Yoo – Packing A-path of length 0 modulo a prime
- Jun 21: Sebastian Wiederrecht – Even Circuits in Oriented Matroids
- Jun 28: Carla Groenland – Universal Graphs and Labelling Schemes
- July 5: Shayla Redlin – Extensions of cliques
- July 12: Eimear Byrne – Some recent results on q-matroids
- July 19: Natasha Morrison – Uncommon systems of equations
- July 26: Matthew Sullivan – Rotation Systems and Simple Drawings of $K_n$
- Sept 14: Evelyne Smith-Roberge – A local choosability theorem for planar graphs
- Sept 21: Zach Walsh – New lift matroids for group-labeled graphs
- Sept 28: Jim Geelen – Is this Ramsey’s Theorem for Matroids?
- Oct 5: Jagdeep Singh – 2-Cographs and Binary Comatroids
- Oct 19: Tara Fife – (Minimal) Tropical Basis for Matroids
- Oct 26: Natalie Behague – Subgraph Games in the Semi-random Graph Process
- Nov 2: Relinde Jurrius – The direct sum of q-matroids
- Nov 9: Dillon Mayhew – Matroids that are transversal and cotransversal
- Nov 16: Nathan Bowler – Infinite Maker-Breaker games
- Nov 23: Tom Kelly – Coloring hypergraphs of small codegree, and a proof of the Erdős–Faber–Lovász conjecture
- Nov 30: Rutger Campbell – Counting Well-Quasi-Ordered Down Sets
- Dec 7: Michael Wigal – Approximating TSP walks in subcubic graphs
- Dec 14: Open Problem Session

**Blog Posts**