TY - JOUR

T1 - Nowhere zero flow and circuit covering in regular matroids

AU - Tarsi, Michael

PY - 1985/12

Y1 - 1985/12

N2 - Let s(k) be the smallest s such that if there exists a k-nowhere zero flow in a regular matroid M, then M can be covered by circuits, the total length of which is at most s|M|. A recursive formula for the evaluation of s(k) is given: s(kt) ≤ (s(k)(kt - t) + s(t)(kt - k)) (kt - 1). By means of this formula s(k) is found for k = 2, 3, 4, 6, 7, 8. "Natural" proofs for graph theoretical results are obtained.

AB - Let s(k) be the smallest s such that if there exists a k-nowhere zero flow in a regular matroid M, then M can be covered by circuits, the total length of which is at most s|M|. A recursive formula for the evaluation of s(k) is given: s(kt) ≤ (s(k)(kt - t) + s(t)(kt - k)) (kt - 1). By means of this formula s(k) is found for k = 2, 3, 4, 6, 7, 8. "Natural" proofs for graph theoretical results are obtained.

UR - http://www.scopus.com/inward/record.url?scp=10644271932&partnerID=8YFLogxK

U2 - 10.1016/0095-8956(85)90059-0

DO - 10.1016/0095-8956(85)90059-0

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:10644271932

SN - 0095-8956

VL - 39

SP - 346

EP - 352

JO - Journal of Combinatorial Theory. Series B

JF - Journal of Combinatorial Theory. Series B

IS - 3

ER -