Matching theorems for combinatorial geometries
HTML articles powered by AMS MathViewer
- by Martin Aigner and Thomas A. Dowling PDF
- Bull. Amer. Math. Soc. 76 (1970), 57-60
References
- Claude Berge, The theory of graphs and its applications, Methuen & Co., Ltd., London; John Wiley & Sons, Inc., New York, 1962. Translated by Alison Doig. MR 0132541
- Henry H. Crapo and Gian-Carlo Rota, On the foundations of combinatorial theory: Combinatorial geometries, Preliminary edition, The M.I.T. Press, Cambridge, Mass.-London, 1970. MR 0290980
- Jack Edmonds and D. R. Fulkerson, Transversals and matroid partition, J. Res. Nat. Bur. Standards Sect. B 69B (1965), 147–153. MR 188090, DOI 10.6028/jres.069B.016
- L. Mirsky and Hazel Perfect, Applications of the notion of independence to problems of combinatorial analysis, J. Combinatorial Theory 2 (1967), 327–357. MR 225675, DOI 10.1016/S0021-9800(67)80034-6
- Oystein Ore, Graphs and matching theorems, Duke Math. J. 22 (1955), 625–639. MR 73171
- R. Rado, A theorem on independence relations, Quart. J. Math. Oxford Ser. 13 (1942), 83–89. MR 8250, DOI 10.1093/qmath/os-13.1.83
Additional Information
- Journal: Bull. Amer. Math. Soc. 76 (1970), 57-60
- MSC (1970): Primary 0504, 0535, 0540; Secondary 0460, 0630
- DOI: https://doi.org/10.1090/S0002-9904-1970-12365-5
- MathSciNet review: 0276116