Transversals of circuits and acyclic orientations in graphs and matroids (Q793043): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claims |
||
| Property / author | |||
| Property / author: Claude Berge / rank | |||
| Property / author | |||
| Property / author: Michel Las Vergnas / rank | |||
Revision as of 04:32, 11 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Transversals of circuits and acyclic orientations in graphs and matroids |
scientific article |
Statements
Transversals of circuits and acyclic orientations in graphs and matroids (English)
0 references
1984
0 references
In a loopless oriented matroid M, if \(A\subseteq M\) is minimal meeting every positive circuit, then \(_{\bar A}M\) (got by sign-reversing the elements of A) is acyclic. This generalizes known results for the cycle and cocycle matroids of a digraph.
0 references
signed circuits
0 references
oriented matroid
0 references
cycle matroids
0 references
