Venue for all talks: Lewis Library Room 120.
Here is the schedule handout.
11:45 Sang-il Oum Constructive algorithm for path-width and branch-width of matroids
12:15 Maria Chudnovsky Coloring graphs with forbidden induced subgraphs
17:00 Charles Semple Recovering a binary matroid without knowing its big circuits
17:30 Thomas Savitsky Enumeration of 2-Polymatroids on up to Seven Elements
9:00 Joseph Bonin Presentations and Extensions of Transversal Matroids
9:30 Antoine Poirier Edge Contraction Reconstruction
12:15 Guoli Ding A splitter theorem for large 3-connected graphs
17:30 Talmage James Reid Binary and Regular Matroids without a Certain Minor
12:15 Rohan Kapadia Graph-like representations of represented matroids
15:30 Hidefumi Hiraishi Excluded minors for orientability and representability of matroids
11:45 Emmanuel Abbe Relationships between entropy and matroids
15:30 Johannes Carmesin Infinite Matroid Intersection Conjecture – An Overview
17:30 Nick Brettell An algorithm for constructing a matroid’s $k$-tree
15:30 Daniel Slilaty Biased graphs realized by gain functions