Advertisement

On small graphs with forced monochromatic triangles

  • R. L. Graham
  • J. H. Spencer
Conference paper
Part of the Lecture Notes in Mathematics book series (LNM, volume 186)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Erdös, P. and Hajnal, A., "Research Problem 2–5", Journal of Combinatorial Theory, Vol. 2, 1967, p. 104.CrossRefGoogle Scholar
  2. 2.
    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).Google Scholar
  3. 3.
    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.MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Lin, S., "On Ramsey Numbers and \(\vec K_r\)-Coloring of Graphs", to appear.Google Scholar
  5. 5.
    Ryser, H. J., "Combinatorial Mathematics, Wiley, New York, 1963.zbMATHGoogle Scholar
  6. 6.
    Schäuble, M., "Zu einem Kantenfärbungsproblem", Wiss. Z. TH Ilmenau 15, Vol. 2, 1969, pp. 55–58.zbMATHGoogle Scholar

Copyright information

© Springer-Verlag 1971

Authors and Affiliations

  • R. L. Graham
    • 1
  • J. H. Spencer
    • 2
  1. 1.Bell Telephone Laboratories, IncorporatedMurray Hill
  2. 2.The Rand CorporationSanta Monica

Personalised recommendations