Skip to main content

On triangular and cyclic ramsey numbers with k colors

Part III: Contributed Papers New Results On Graphs And Combinatorics

Part of the Lecture Notes in Mathematics book series (LNM,volume 406)

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).

Keywords

  • Projective Plane
  • Adjacency Matrix
  • Small Integer
  • RAMSEY Number
  • Combinatorial Mathematic

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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