Abstract
The theorem of R. Rado (12) to which I refer by the name ‘Rado's theorem for matroids’ gives necessary and sufficient conditions for a family of subsets of a finite setYto have a transversal independent in a given matroid onY. This theorem is of fundamental importance in both transversal theory and matroid theory (see, for example, (11)). In (3) J. Edmonds introduced and studied ‘polymatroids’ as a sort of continuous analogue of a matroid. I start this paper with a brief introduction to polymatroids, emphasizing the role of the ‘ground-set rank function’. The main result is an analogue for polymatroids of Rado's theorem for matroids, which I call not unnaturally ‘Rado's theorem for polymatroids’.
Publisher
Cambridge University Press (CUP)
Reference17 articles.
1. On Matroid Theorems of Edmonds and Rado
2. (17) Woodall D. R. Applications of polymatroids and linear programming to transversals and graphs. (To appear.)
3. (16) Woodall D. R. The induction of matroids by graphs. (To appear.)
4. Some graphical properties of matrices with non-negative entries
Cited by
53 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献