𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Cycle covering of binary matroids

✍ Scribed by Ury Jamshy; Michael Tarsi


Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
408 KB
Volume
46
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Cycle Cover Ratio of Regular Matroids
✍ Hong-Jian Lai; Hoifung Poon πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 180 KB

A cycle in a matroid is a disjoint union of circuits. This paper proves that every regular matroid M without coloops has a set S of cycles whose union is E(M) such that every element is in at most three of the cycles in S. It follows immediately from this that, on average, each element of M is in at

Counting maximal cycles in binary matroi
✍ P. Hoffmann πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 68 KB

It is shown that each binary matroid contains an odd number of maximal cycles and, as a result of this, that each element of an Eulerian binary matroid is contained in an odd number of circuits. Let M be a binary matroid with circuits ~(M) and cycles .~(M), and let ~e(M) be the set of circuits conta

The Cocycle Lattice of Binary Matroids
✍ LΓ‘szlΓ³ LovΓ‘sz; Ákos Seress πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 330 KB

We study the lattice (grid) generated by the incidence vectors of cocycles of a binary matroid and its dual tattice. We characterize those binary matroids for which the obvious necessary conditions for a vector to belong to the cocycle lattice are also sufficient. This characterization yields a poly

Classification of binary covering codes
✍ Patric R. J. Γ–stergΓ₯rd; William D. Weakley πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 147 KB
The cocycle lattice of binary matroids,
✍ LΓ‘szlΓ³ LovΓ‘sz; Ákos Seress πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 836 KB