Covers and packings in a family of sets
HTML articles powered by AMS MathViewer
- by Jack Edmonds PDF
- Bull. Amer. Math. Soc. 68 (1962), 494-499
References
- Claude Berge, Théorie des graphes et ses applications, Collection Universitaire de Mathématiques, II, Dunod, Paris, 1958 (French). MR 0102822
- Claude Berge, Two theorems in graph theory, Proc. Nat. Acad. Sci. U.S.A. 43 (1957), 842–844. MR 94811, DOI 10.1073/pnas.43.9.842
- D. R. Fulkerson and H. J. Ryser, Widths and heights of $(0,\,1)$-matrices, Canadian J. Math. 13 (1961), 239–255. MR 138555, DOI 10.4153/CJM-1961-020-3
- Marshall Hall Jr., A survey of combinatorial analysis, Some aspects of analysis and probability, Surveys in Applied Mathematics. Vol. 4, John Wiley & Sons, Inc., New York, N.Y.; Chapman & Hall, Ltd., London, 1958, pp. 35–104. MR 0111694
- Robert Z. Norman and Michael O. Rabin, An algorithm for a minimum cover of a graph, Proc. Amer. Math. Soc. 10 (1959), 315–319. MR 106853, DOI 10.1090/S0002-9939-1959-0106853-5
- J. Paul Roth, Algebraic topological methods for the synthesis of switching systems. I, Trans. Amer. Math. Soc. 88 (1958), 301–326. MR 97285, DOI 10.1090/S0002-9947-1958-0097285-0
Additional Information
- Journal: Bull. Amer. Math. Soc. 68 (1962), 494-499
- DOI: https://doi.org/10.1090/S0002-9904-1962-10791-5
- MathSciNet review: 0150050