𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Connectivity Function of a Binary Matroid

✍ Scribed by Manoel Lemos

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
210 KB
Volume
86
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper, we shall consider the following problem: up to duality, is a connected matroid reconstructible from its connectivity function? Cunningham conjectured that this question has an affirmative answer, but Seymour gave a counter-example for it. In the same paper, Seymour proved that a connected binary matroid is always reconstructible from its connectivity function, up to duality, in the class of binary matroids. In this paper, we prove that when M is a connected binary matroid and N another matroid with the same connectivity function as N ; then M ΒΌ N or M ΒΌ N n :

πŸ“œ SIMILAR VOLUMES

The Cocycle Lattice of Binary Matroids
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

On the Structure of 3-connected Matroids
On the Structure of 3-connected Matroids and Graphs
✍ James Oxley; Haidong Wu πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 249 KB

An element e of a 3-connected matroid M is essential if neither the deletion M\e nor the contraction M/e is 3-connected. Tutte's Wheels and Whirls Theorem proves that the only 3-connected matroids in which every element is essential are the wheels and whirls. In this paper, we consider those 3-conne