Research materials created and accumulated by Donald Cowan related to Ramsey theory. Includes published papers, articles, conference papers and copies of unpublished papers relating to Ramsey theory and in particular, Ramsey theory for graphs. Items include:
-
1. Harary, Frank. (July 31, 1970). Covering and packaging in graphs, I. Annals of The New York Academy of Sciences 175, pages 198-205.
-
2. Wilkov, R.S. (December 11, 1970). Reliability considerations in computer network design. Mathematical Sciences Department, IBM, Thomas J. Watson Research Center (RC 3180).
-
3. Chvátal, Václav and Frank Harary. (1972). Generalized Ramsey theory for graphs, III. Small off-diagonal numbers. Pacific Journal of Mathematics, volume 41, (number 2), pages 335-345.
-
4. Chvátal, Václav and Frank Harary. (April 1972). Generalized Ramsey theory for graphs, II. Small diagonal numbers. Proceedings of the American Mathematical Society, volume 32, (number 2), pages 389-394.
-
5. Chvátal, Vaclav and Frank Harary. (May 1972). Generalized Ramsey theory for graphs. Bulletin of the American Mathematical Society, volume 78, (number 3), pages 423-426.
-
6. Chvátal, V. and F. Harary. (1973). Generalized Ramsey theory for graphs, I. Diagonal numbers. Periodica Mathematica Hungarica, volume 3 (number 1-2), pages 115-124.
-
7. Harary, Frank. (June 19, 1973). A survey of generalized Ramsey theory. 12 pages.
-
8. Hoffman, A.J. (January 18, 1974). Eigenvalue of graphs. Mathematical Sciences Department, IBM Watson Research Center (RC 4688).
-
9. Hoffman, Alan J. and John Howard Smith. (May 20, 1974). On the spectral radii of topologically equivalent graphs. Mathematical Sciences Department, IBM Watson Research Center (RC 4851).
-
10. Hoffman, A.J. (June 13, 1974). Applications of Ramsey style theorems to eigenvalue of graphs. Mathematical Sciences Department, IBM Watson Research Center (RC 4882).
-
11. Thulasiraman, K and P. Karivaratharajan. (December 1974). K-sets of a graph and vulnerability of communication nets. The Matrix and Tensor Quarterly, pages 63-66.
-
12. Harary, Frank. (1975). The foremost open problems in generalized Ramsey theory. Proceedings of the Fifth British Combinatorial Conference, pages 269-282.
-
13. Harary, Frank and Pavol Hell. (1975). Generalized Ramsey theory for graphs V. The Ramsey number of a digraph. Bulletin of the London Mathematical Society, volume 6, pages 75-182.
-
14. Pearce. A.R. (1975). Bibliography on algorithms for shortest path, shortest spanning tree, and related circuit routing problems (1956-1974). Networks, volume 5, pages 129-149.
-
15. Thulasiraman, K and P. Karivaratharajan. (March 1975). K-sets of a graph and vulnerability of communication nets. The Matrix and Tensor Quarterly, pages 77-86.
-
16. Hoffman, A.J. (March 15, 1976). On signed graphs and gramians. Mathematical Sciences Department, IBM Thomas J. Watson Research Center (RC 5905).
-
17. Duke, Richard A. and Frank Harary. (1976). Generalized Ramsey theory VI: Ramsey numbers for small plexes. The Journal of The Australian Mathematical Society, volume 4, number 12, pages 400-410.
-
18. Burr, Stefan A. and Frank Harary. (1977). The Ramsey number of many stars and one triangle. ARS Combinatoria, volume 4, pages 119-122.
-
19. Harary, Frank. Generalized Ramsey theory for graphs XI: which numbers are graphical? 13 pages.
-
20. Harary, Frank. Generalized Ramsey theory XII: achievement and avoidance games on finite geometries and configurations. 10 pages.
-
21. Harary, Frank and Pavol Hell. Corrections: generalized Ramsey theory for graphs V. L.M.S. Bulletin, 1 page.