Let \(M=(E,{\mathcal F})\) be a matroid on the underlying set E (\({\mathcal F}\) is the collection of flats of M). A simple matroid \(A=(S,{\mathcal T})\) is the adjoint of M if \(r_ M(E)=r_ A(S)\) and there exists an injection \(\phi\) : \({\mathcal F}\to {\mathcal T}\) such that for \(F_ 1,F_ 2\in {\mathcal F}\), if \(F_ 1\subseteq F_ 2\) then \(\phi (F_ 2)\subseteq \phi (F_ 1)\) and \(\phi\) maps the set of hyperplanes onto S. The authors prove that a binary matroid has only binary adjoints if and only if it is either nonregular or graphic and has no \(K_ 4\) or \(K_{2,3}\) minor.
- Adjoints of a Geometry
- Characterizations of outerplanar graphs
- Converting Linear Programs to Network Problems
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 3608715 (Why is no real title available?)
- scientific article; zbMATH DE number 3259770 (Why is no real title available?)
- scientific article; zbMATH DE number 3372067 (Why is no real title available?)
- Lectures on matroids
- Recognizing graphic matroids
- Adjoints of oriented matroids
- Adjacency in binary matroids
- Matroids without adjoint
- A minimal 3-connectedness result for matroids
- On pseudomodular matroids and adjoints
- The adjacency matroid of a graph
- scientific article; zbMATH DE number 903949 (Why is no real title available?)
- scientific article; zbMATH DE number 937440 (Why is no real title available?)
- Adjoints of matroids
- Modifications of hyperplane arrangements
- One-element extensions of hyperplane arrangements
- k-adjoint of hyperplane arrangements
- On adjoints and dual matroids
This page was built for publication: Adjoints of binary matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1109040)
