×

Ramsey numbers in rainbow triangle free colorings. (English) Zbl 1196.05052

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.

MSC:

05C55 Generalized Ramsey theory
PDFBibTeX XMLCite