References
Behzad, M., Radjavi, H.: The line analog of Ramsey numbers. Israel J. Math.5, 93–96 (1967).
Erdos, P.: Some remarks on the theory of graphs. Bull. Amer. Math. Soc.53, 292–294 (1947).
—— Remarks on a theorem of Ramsey. Bull. Res. Counc. Israel,7F, 21–24 (1957).
Erdos, P.: Graph theory and probability I. Canad. J. Math.11, 34–38 (1959).
—— Graph theory and probability II. Canad. J. Math.13, 346–352 (1961).
Graver, J. E., Yackel, J.: An upper bound for Ramsey numbers. Bull. Amer. Math. Soc.72, 1076–1079 (1966).
Greenwood, R. E., Gleason: Combinatorial relations and chromatic graphs. Canad. J. Math.7, 1–7 (1955).
Harary, F.: A seminar on graph theory. New York: Holt, Rinehart, and Winston 1967.
Kalbfleisch: Canad. Math. Bull.8, 575–584 (1965).
Ore, O.: Theory of graphs. Amer. Math. Soc. Colloq.38, Providence, 1962.
Author information
Authors and Affiliations
Additional information
Definitions not given here can be found in [8, 10].
Rights and permissions
About this article
Cite this article
Behzad, M., Radjavi, H. Another analog of Ramsey numbers. Math. Ann. 186, 228–232 (1970). https://doi.org/10.1007/BF01433281
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01433281