Abstract
The circuits containing some fixed element of a connected matroid (such a collection is called a port) provide a matroid generalization of the "path collections" of graphs. In this note we show how to translate forbidden minor theorems in matroid theory into results about ports - and we find that many theorems are strengthened by such translation. Those collections of sets which are "path collections" of graphs may then be characterized.
Original language | English (US) |
---|---|
Pages (from-to) | 289-295 |
Number of pages | 7 |
Journal | Journal of Combinatorial Theory, Series B |
Volume | 22 |
Issue number | 3 |
DOIs | |
State | Published - Jun 1977 |
Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics