### Matroids on graphs (Daniel Bernstein, Tulane)

- Series
- Graph Theory Seminar
- Time
- Tuesday, March 26, 2024 - 15:30 for 1 hour (actually 50 minutes)
- Location
- Skiles 006
- Speaker
- Daniel Bernstein – Tulane University – dbernstein1@tulane.edu

Many problems in rigidity theory and matrix completion boil down to finding a nice combinatorial description of some matroid supported on the edge set of a complete (bipartite) graph. In this talk, I will give many such examples. My goal is to convince you that a general theory of matroids supported on graphs is needed and to give you a sense of what that could look like.