Nowhere zero flow and circuit covering in regular matroids

Michael Tarsi*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

10 Scopus citations

Abstract

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.

Original languageEnglish
Pages (from-to)346-352
Number of pages7
JournalJournal of Combinatorial Theory. Series B
Volume39
Issue number3
DOIs
StatePublished - Dec 1985

Fingerprint

Dive into the research topics of 'Nowhere zero flow and circuit covering in regular matroids'. Together they form a unique fingerprint.

Cite this