Inseparability graphs of oriented matroids (Q750448)

Let M be an oriented matroid of rank r defined on an n-set E. Two distinct points \(x'\) and \(x''\) of E are called inseparable in M if and only if \(x'\) and \(x''\) have always, in all circuits of M containing them, either the same sign or opposite signs. The inseparability graph of M has E as vertex set and the inseparable pairs of points of M as edges. The author determines the inseparability graphs of uniform oriented matroids and of graphic oriented matroids. He gives also examples of rank r uniform oriented matroids on n points with a given inseparability graph, for all pairs r, n such that \(4\leq r\leq n-3\).