DMS Combinatorics Seminar

Speaker: Sayantani Bhattacharya (Auburn University)

Title: The Unbreakable Quasigraphic Matroid

Abstract: Quasi-graphic matroids are combinatorial objects that generalize graphs. A matroid which is also unbreakable has the structural property that contraction of a ‘closed' set does not disconnect it, which gives additional insight on the matroid in question. We generalize and strengthen a number of results of Fife, Mayhew, Oxley, and Semple to characterize the underlying graphs of unbreakable quasi-graphic matroids. We assume no knowledge of matroid theory.

This is joint work with John David Clifton and Zach Walsh.