# Cycle covering of binary matroids

@article{Jamshy1989CycleCO, title={Cycle covering of binary matroids}, author={Ury Jamshy and Michael Tarsi}, journal={J. Comb. Theory, Ser. B}, year={1989}, volume={46}, pages={154-161} }

- Published in J. Comb. Theory, Ser. B 1989
DOI:10.1016/0095-8956(89)90041-5

Motivated by some problems which had been left open in a previous paper [M. Tarsi, J. Combin. Theory Ser. B 39 (1985), 346–352], we present the following results:
1.
1. Every bridgeless binary matroid with no F7∗ minor (in particular every regular matroid) had a cycle in which every element is covered exactly 4 times.
2.
2. The cycle double cover conjecture for graphs is equivalent to a simular conjecture for binary matroids with no F7∗ minor.
3.
3. We give the lowest upper bounds for… CONTINUE READING

#### Topics from this paper.

#### Citations

##### Publications citing this paper.

SHOWING 1-6 OF 6 CITATIONS

## Cones, lattices and Hilbert bases of circuits and perfect matchings

VIEW 11 EXCERPTS

CITES METHODS & BACKGROUND

HIGHLY INFLUENCED

## Cycle Cover Ratio of Regular Matroids

VIEW 4 EXCERPTS

CITES BACKGROUND

HIGHLY INFLUENCED

## A bound on the total size of a cut cover

VIEW 1 EXCERPT

CITES BACKGROUND

## Covering a graph with cuts of minimum total size

VIEW 1 EXCERPT

CITES BACKGROUND