✦ LIBER ✦

On binary paving matroids

✍ Scribed by Dragan M. Acketa

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 206 KB
Volume: 70
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(88)90085-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On binary k-paving matroids and Reed-Mul

On binary k-paving matroids and Reed-Muller codes

✍ Sanjay Rajpal 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 487 KB

A matroid Jr' of rank r>.k is k-paving if all of its circuits have cardinality exceeding r-k. In this paper, we develop some basic results concerning k-paving matroids and their connections with codes. Also, we determine all binary 2-paving matroids. (~

Ternary paving matroids

✍ James G. Oxley 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 578 KB

Note on binary simplicial matroids

✍ Jiří Tůma 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 117 KB

Using an earlier characterization of simplicial hypergraphs we obtain a characterization of binary simplicial matroids in terms of the existence of a special base.

Connected Hyperplanes in Binary Matroids

✍ Jennifer McNulty; Haidong Wu 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 125 KB

In this paper, we prove that any simple and cosimple connected binary matroid has at least four connected hyperplanes. We further prove that each element in such a matroid is contained in at least two connected hyperplanes. Our main result generalizes a matroid result of Kelmans, and independently,

A construction for binary matroids

✍ Francisco Barahona; Michele Conforti 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 384 KB

A family of subsets of a ground set closed under the operation of taking symmetric differences is the family of cycles of a binary matroid. Its circuits are the minimal members of this collection. We use this basic property to derive binary matroids from binary matroids. In particular, we derive two

Cycle covering of binary matroids

✍ Ury Jamshy; Michael Tarsi 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 408 KB