The biased graphs whose matroids are binary (Q1117234): Difference between revisions

A biased graph consists of an underlying graph and a collection of its polygons such that, if the symmetric difference of two polygons in the collection is a polygon, then it belongs to the collection. There are three matroids naturally associated to biased graphs; they are essentially the same as the polygon matroids when the collection considered is the collection of all polygons. The bicircular and the even-cycle matroids can also appear as particular instances with other choices for the collection of polygons. These more general matroids are called the bias, the lift and the complete lift matroids. A characterization is given for those biased graphs for which any of these three matroids are binary.