Faudree, Ralph J.; Gould, Ronald J.; Jacobson, Michael S.; Magnant, Colton Ramsey numbers in rainbow triangle free colorings. (English) Zbl 1196.05052 Australas. J. Comb. 46, 269-284 (2010). Summary: 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 \(C_4\) and all trees on at most 6 vertices and bounds are provided for general paths. Cited in 2 ReviewsCited in 23 Documents MSC: 05C55 Generalized Ramsey theory Keywords:Ramsey number; three colored triangle; monochromatic cycle; monochromatic tree PDFBibTeX XMLCite \textit{R. J. Faudree} et al., Australas. J. Comb. 46, 269--284 (2010; Zbl 1196.05052)