Abstract
The connectivity function k of a matroid M on a set E is defined by k(X) = r(X) + r(E - X) - r(E) (X ⊆ E), where r is the rank function. W. H. Cunningham conjectured that a connected matroid is determined, up to duality, by a knowledge of its connectivity function. This is false in general, but true for binary matroids.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 25-30 |
| Number of pages | 6 |
| Journal | Journal of Combinatorial Theory, Series B |
| Volume | 45 |
| Issue number | 1 |
| DOIs | |
| State | Published - Aug 1988 |
| Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics