Complementation, local complementation, and switching in binary matroids
From MaRDI portal
Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph operations (line graphs, products, etc.) (05C76)
Abstract: In 2004, Ehrenfeucht, Harju, and Rozenberg showed that any graph on a vertex set can be obtained from a complete graph on via a sequence of the operations of complementation, switching edges and non-edges at a vertex, and local complementation. The last operation involves taking the complement in the neighbourhood of a vertex. In this paper, we consider natural generalizations of these operations for binary matroids and explore their behaviour. We characterize all binary matroids obtainable from the binary projective geometry of rank under the operations of complementation and switching. Moreover, we show that not all binary matroids of rank at most can be obtained from a projective geometry of rank via a sequence of the three generalized operations. We introduce a fourth operation and show that, with this additional operation, we are able to obtain all binary matroids.
Recommendations
- Binary matroids and local complementation
- Complementarity in Oriented Matroids
- Transitivity of local complementation and switching on graphs.
- scientific article; zbMATH DE number 4202305
- LINEAR COMPLEMENTARITY AND ORIENTED MATROIDS
- Completeness in oriented matroids
- On the cogirth of binary matroids
- On the circuit-spectrum of binary matroids
- Decomposition of binary matroids
- scientific article; zbMATH DE number 1168010
Cites work
Cited in
(4)
This page was built for publication: Complementation, local complementation, and switching in binary matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2020035)