Short circuit covers for regular matroids with a nowhere zero 5-flow (Q1112053): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Shortest coverings of graphs with cycles / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3236252 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Flows and generalized coloring theorems in graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Nowhere zero flow and circuit covering in regular matroids / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Contribution to the Theory of Chromatic Polynomials / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Class Of Abelian Groups / rank | |||
Normal rank | |||
Latest revision as of 11:02, 19 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Short circuit covers for regular matroids with a nowhere zero 5-flow |
scientific article |
Statements
Short circuit covers for regular matroids with a nowhere zero 5-flow (English)
0 references
1987
0 references
The following theorem is proved: If there exists a nowhere zero 5-flow in a regular matroid on a set E, then it can be covered by circuits whose total length does not exceed \(\frac{8}{5}| E|\). The constant \(\frac{8}{5}\) is the smallest for which such a statement holds.
0 references
nowhere zero 5-flow
0 references
regular matroid
0 references
total length
0 references
