Extensions of flow theorems (Q1354719): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1006/jctb.1997.1727 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2070647236 / rank | |||
Normal rank |
Revision as of 23:14, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Extensions of flow theorems |
scientific article |
Statements
Extensions of flow theorems (English)
0 references
26 October 1997
0 references
As an extension of Seymour's 6-flow theorem, the author proves that every 2-edge-connected graph has a set \(\mathcal C\) of vertex disjoint cycles and a 3-flow \(f\) such that \(f(e)=0\) only if \(e\) belongs to one of the cycles in \(\mathcal C\). An extension of Jaeger's 8-flow theorem as well as applications to the short cycle cover problem, are also given. In particular, it is shown that the edges of a 2-edge-connected graph \(G\) can be covered by cycles whose total length is at most \[ |E(G)|+ {r\over r+1} (|V(G)|- 1), \] where \(r\) is the minimum length of an even cycle in \(G\) of length at least 10 (if no such cycle exists, \(r=\infty\)).
0 references
flow theorems
0 references
short cycle cover
0 references