Transversals of circuits and acyclic orientations in graphs and matroids (Q793043)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Transversals of circuits and acyclic orientations in graphs and matroids |
scientific article; zbMATH DE number 3855135
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Transversals of circuits and acyclic orientations in graphs and matroids |
scientific article; zbMATH DE number 3855135 |
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
0.771838903427124
0 references
0.7479576468467712
0 references
0.7371729612350464
0 references
0.7343565821647644
0 references
0.7255916595458984
0 references
