Basis graphs of even delta-matroids (Q864897): Difference between revisions

A \(\Delta\)-matroid is a collection \({\mathcal B}\) of subsets of a finite set \(I\), called bases satisfying the symmetric exchange property. The basis graph of a \(\Delta\)-matroid is the graph whose vertices are the bases of \({\mathcal B}\) and two vertices are joined by an edge if their symmetric difference equals two. In this paper, the author presents a characterization of basis graphs of even \(\Delta\)-matroids (\(\Delta\)-matroids whose bases all have the same cardinality modulo 2).