Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Erdös, P. and Hajnal, A., "Research Problem 2–5", Journal of Combinatorial Theory, Vol. 2, 1967, p. 104.
Folkman, J. H., "Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring", Rand Corporation Memorandum RM-53-58-PR, October 1967 (to appear in SIAM Journal of Applied Mathematics).
Graham, R. L., "On Edgewise 2-Colored Graphs with Monochromatic Triangles and Containing No Complete Hexagon", Journal of Combinatorial Theory, Vol. 4, No. 3, April 1968, p. 300.
Lin, S., "On Ramsey Numbers and \(\vec K_r\)-Coloring of Graphs", to appear.
Ryser, H. J., "Combinatorial Mathematics, Wiley, New York, 1963.
Schäuble, M., "Zu einem Kantenfärbungsproblem", Wiss. Z. TH Ilmenau 15, Vol. 2, 1969, pp. 55–58.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1971 Springer-Verlag
About this paper
Cite this paper
Graham, R.L., Spencer, J.H. (1971). On small graphs with forced monochromatic triangles. In: Capobianco, M., Frechen, J.B., Krolik, M. (eds) Recent Trends in Graph Theory. Lecture Notes in Mathematics, vol 186. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0059431
Download citation
DOI: https://doi.org/10.1007/BFb0059431
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-05386-6
Online ISBN: 978-3-540-36508-2
eBook Packages: Springer Book Archive