This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
M. Behzad and H. Radjavi, The line analogue of Ramsey Numbers, Israel J. Math., 5 (1967), 93–96.
P. Erdös, Some remarks on the theory of graphs, Bull. Amer. Math. Soc., 53 (1947), 292–294.
P. Erdös, Remarks on a theorem of Ramsey, Bull. Res. Counc. Israel, 7F (1957), 21–24.
P. Erdös, Graph theory and probability I, Canad. J. Math., 11 (1959), 34–38.
P. Erdös, Graph theory and probability II, Canad. J. Math., 13 (1961), 346–352.
J.E. Graver and J. Yackel, An upper bound for Ramsey numbers, Bull. Amer. Math. Soc., 72 (1966), 1076–1079.
R.E. Greenwood and Gleason, Combinatorial relations and chromatic graphs, Canad. J. Math., 7 (1955), 1–7.
J. Kalbfleisch, On an unknown Ramsey number, Mich. Math. J., 13 (1966), 385–392.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1969 Springer-Verlag
About this paper
Cite this paper
Behzad, M. (1969). Analogues of ramsey numbers. In: Chartrand, G., Kapoor, S.F. (eds) The Many Facets of Graph Theory. Lecture Notes in Mathematics, vol 110. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0060103
Download citation
DOI: https://doi.org/10.1007/BFb0060103
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-04629-5
Online ISBN: 978-3-540-36161-9
eBook Packages: Springer Book Archive