... contains a subgraph on k − 1 vertices not in In(H) and by Proposition 2, thereis a k-coloring of G avoiding rainbow induced copies of H. Therefore, if any k-coloring of G contains a rainbow induced ... x10.Butthen{x10,x1,x2,x5} induces a rainbow Λ, a contradiction.Claim 3. Any coloring of G(3) in 4 colors contains an induced rainbow Λ.Let c be a coloring of G(3) using colors 1, 2, 3, 4 and containing no induced ... k-coloring of vertices of G avoiding totally multicolored induced subgraphs isomorphic to H.Thus,weprovide a vertex -induced anti-Ramsey result, extending the induced- vertex-Ramseytheorems by Deuber,...