Short circuit covers for regular matroids with a nowhere zero 5-flow

Ury Jamshy; Andre Raspaud; Michael Tarsi

doi:10.1016/0095-8956(87)90011-6

Short circuit covers for regular matroids with a nowhere zero 5-flow

Ury Jamshy^*, Andre Raspaud, Michael Tarsi

^*Corresponding author for this work

School of Computer Science and AI

Research output: Contribution to journal › Article › peer-review

18 Scopus citations

Abstract

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 8 5|E|. The constant 8 5 is the smallest for which such a statement holds.

Original language	English
Pages (from-to)	354-357
Number of pages	4
Journal	Journal of Combinatorial Theory. Series B
Volume	43
Issue number	3
DOIs	https://doi.org/10.1016/0095-8956(87)90011-6
State	Published - Dec 1987

Access to Document

10.1016/0095-8956(87)90011-6

Cite this

@article{7c5e8cee2fa144aaa67741486ecad54f,

title = "Short circuit covers for regular matroids with a nowhere zero 5-flow",

abstract = "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 8 5|E|. The constant 8 5 is the smallest for which such a statement holds.",

author = "Ury Jamshy and Andre Raspaud and Michael Tarsi",

year = "1987",

month = dec,

doi = "10.1016/0095-8956(87)90011-6",

language = "אנגלית",

volume = "43",

pages = "354--357",

journal = "Journal of Combinatorial Theory. Series B",

issn = "0095-8956",

publisher = "Academic Press Inc.",

number = "3",

}

TY - JOUR

T1 - Short circuit covers for regular matroids with a nowhere zero 5-flow

AU - Jamshy, Ury

AU - Raspaud, Andre

AU - Tarsi, Michael

PY - 1987/12

Y1 - 1987/12

N2 - 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 8 5|E|. The constant 8 5 is the smallest for which such a statement holds.

AB - 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 8 5|E|. The constant 8 5 is the smallest for which such a statement holds.

UR - https://www.scopus.com/pages/publications/26444569411

U2 - 10.1016/0095-8956(87)90011-6

DO - 10.1016/0095-8956(87)90011-6

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

AN - SCOPUS:26444569411

SN - 0095-8956

VL - 43

SP - 354

EP - 357

JO - Journal of Combinatorial Theory. Series B

JF - Journal of Combinatorial Theory. Series B

IS - 3

ER -

Short circuit covers for regular matroids with a nowhere zero 5-flow

Abstract

Access to Document

Other files and links

Fingerprint

Cite this