Generalized Ramsey theory for graphs
HTML articles powered by AMS MathViewer
- by Václav Chvátal and Frank Harary PDF
- Bull. Amer. Math. Soc. 78 (1972), 423-426
References
- P. Erdös, Some remarks on the theory of graphs, Bull. Amer. Math. Soc. 53 (1947), 292–294. MR 19911, DOI 10.1090/S0002-9904-1947-08785-1
- P. Erdős, On the number of complete subgraphs contained in certain graphs, Magyar Tud. Akad. Mat. Kutató Int. Közl. 7 (1962), 459–464 (English, with Russian summary). MR 151956
- P. Erdős and M. Simonovits, A limit theorem in graph theory, Studia Sci. Math. Hungar. 1 (1966), 51–57. MR 205876
- A. W. Goodman, On sets of acquaintances and strangers at any party, Amer. Math. Monthly 66 (1959), 778–783. MR 107610, DOI 10.2307/2310464
- Frank Harary, Graph theory, Addison-Wesley Publishing Co., Reading, Mass.-Menlo Park, Calif.-London 1969. MR 0256911, DOI 10.21236/AD0705364
- J. W. Moon and L. Moser, On chromatic bipartite graphs, Math. Mag. 35 (1962), 225–227. MR 144331, DOI 10.2307/2688555 7. F. P. Ramsey, On a problem of formal logic, Proc. London Math. Soc. 30 (1930), 264-286.
- Gary Chartrand and Seymour Schuster, On the existence of specified cycles in complementary graphs, Bull. Amer. Math. Soc. 77 (1971), 995–998. MR 289336, DOI 10.1090/S0002-9904-1971-12832-X
Additional Information
- Journal: Bull. Amer. Math. Soc. 78 (1972), 423-426
- MSC (1970): Primary 05C35, 05A05; Secondary 05C15
- DOI: https://doi.org/10.1090/S0002-9904-1972-12927-6
- MathSciNet review: 0291016