Graphs and Matroids Seminar: Bertrand Guenin

Title: Recognizing even-cycle and even-cut matroids

Abstract:

An even-cycle matroid is a binary matroid whose cycles are the even cardinality cycles of a signed graph. We show that given a 0,1 matrix representation of binary matroid we can check in polynomial time if the matroid is an even-cycle matroid. We also prove the analogous result for even-cut matroids.

This is joint work with Cheolwon Cheo and relies on earlier results by I. Pivotto and P. Wollan.