Graphs and binary matroids whose odd circuits all have size three or five 10/29/2019

Speaker: Carolyn Chun, USNA
Date and time: Tuesday, October 29, 1–2pm
Place: Phillips 110

Abstract: Graphs with no odd circuits are well understood. In 1992, Maffray characterized the all graphs whose odd circuits only have size three. Oxley and Wetzler generalized this result to binary matroids in 2016. We give a complete characterization of all binary matroids whose odd circuits all have size three or five, as well as the graphs whose odd cycles all have size three or five. This is based on joint work with James Oxley and Kris Wetzler.