Abstract
Define r(G;k) to be the smallest integer with the following property: For any n ≥ r(G;k), color the edges of Kn in k colors, then there exists a monochromatic graph isomorphic to G. In this paper, we discussed the bounds for r(K3;k) and r(C4;k).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1974 Springer-Verlag Berlin
About this paper
Cite this paper
Chung, F. (1974). On triangular and cyclic ramsey numbers with k colors. In: Bari, R.A., Harary, F. (eds) Graphs and Combinatorics. Lecture Notes in Mathematics, vol 406. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0066445
Download citation
DOI: https://doi.org/10.1007/BFb0066445
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06854-9
Online ISBN: 978-3-540-37809-9
eBook Packages: Springer Book Archive