Hostname: page-component-5f745c7db-6bmsf Total loading time: 0 Render date: 2025-01-06T11:30:11.115Z Has data issue: true hasContentIssue false
  • English
  • Français

Rado's theorem for polymatroids

Published online by Cambridge University Press:  24 October 2008

Colin J. H. McDiarmid
Colin J. H. McDiarmid
Affiliation:
Corpus Christi College, Oxford
Get access Rights & Permissions [Opens in a new window]

Extract

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 set Y to have a transversal independent in a given matroid on Y. 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’.

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 78 , Issue 2 , September 1975 , pp. 263 - 281
Copyright
Copyright © Cambridge Philosophical Society 1975

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

(1)Dulmage, A. L. and Mendelsohn, N. S.Some graphical properties of matrices with non-negative entries. Aequationes Math. 2 (1969), 150–162.Google Scholar
(2)Dunstan, F. D. J. Some aspecta of combinatorial theory. D.Phil thesis, Oxford, 1973.Google Scholar
(3)Edmonds, J.Submodular function, matroids, and certain polyhedra. Lectures, Calgary International Symposium on Combinatorial Structures, 06 1969.Google Scholar
(4)Folkman, J. and Fulkerson, D. R. Edge-colourings in bipartite graphs. Chapter 31 in Combinatorial mathematics and its applications, ed. Bose, R. C. and Dowling, T. A. (University of North Carolina Press, Chapel Hill, 1969).Google Scholar
(5)Ford, L. R. and Fulkerson, D. R.Flows in networks (Princeton University Press, 1962).Google Scholar
(6)Hall, P.On representatives of subsets. J. London Math. Soc. 10 (1935), 26–30.Google Scholar
(7)Ingleton, A. W. and Piff, M. J.Gammoids and transversal matroids. J. Combinatorial Theory B 15 (1973), 51–68.Google Scholar
(8)McDiarmid, C. J. H.The solution of a timetabling problem. J. Inst. Math. Appl. 9 (1972), 23–24.Google Scholar
(9)McDiarmid, C. J. H.Independence structures and submodular functions. Bull London. Math. Soc. 5 (1973), 18–20.Google Scholar
(10)McDiarmid, C. J. H.Path-partition structures of graphs and digraphs. Proc. London Math. Soc. (3) 29 (1974), 750–768.Google Scholar
(11)Mirsky, L.Transversal theory (Academic Press, 1971).Google Scholar
(12)Rado, R. A theorem on independence relations. Quart. J. Math. (Oxford) 13 (1942), 83–89.Google Scholar
(13)Welsh, D. J. A.On matroid theorems of Edmonds and Rado. J. London Math. Soc. (2) 2 (1970), 251–256.Google Scholar
(14)Welsh, D. J. A. Related classes of set functions. Studies in Pure Mathematics (presented to Richard Rado), pp. 261–269 (Academic Press, London, 1971).Google Scholar
(15)De Werra, D.On some combinatorial problems arising in scheduling. Canad. Op. Rea. Soc. Journal 8 (1970), 165–175.Google Scholar
(16)Woodall, D. R. The induction of matroids by graphs. (To appear.)Google Scholar
(17)Woodall, D. R. Applications of polymatroids and linear programming to transversals and graphs. (To appear.)Google Scholar