Abstract
With the help of the concept of a linking system, theorems relating matroids with bipartite graphs and directed graphs are deduced. In this way natural generalizations of theorems of Edmonds & Fulkerson, Perfect, Pym. Rado, Brualdi and Mason are obtained. Furthermore some other properties of these linking systems are investigated.
| Original language | English |
|---|---|
| Pages (from-to) | 349-369 |
| Number of pages | 21 |
| Journal | Journal of Combinatorial Theory, Series B |
| Volume | 26 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 1979 |