Skip to main content
Ramsey Numbers in Rainbow Triangle Free Colorings
Australasian Journal of Combinatorics (2010)
  • Colton Magnant, Georgia Southern University
  • Ralph J. Faudree, University of Memphis
  • Michael S. Jacobson
  • Ronald Gould, Emory University

Given a graph G, we consider the problem of finding the minimum number n such that any k edge colored complete graph on n vertices contains either a three colored triangle or a monochromatic copy of the graph G. This number is found precisely for a C4 and all trees on at most 6 vertices and bounds are provided for general paths.

  • Ramsey numbers,
  • Monochromatic copy
Publication Date
Citation Information
Colton Magnant, Ralph J. Faudree, Michael S. Jacobson and Ronald Gould. "Ramsey Numbers in Rainbow Triangle Free Colorings" Australasian Journal of Combinatorics Vol. 46 (2010)
Available at: