... Consider a copy of H in G. It contains at least one of the components of order m, thus it has at least two vertices of the same color. Therefore there is no rainbowinduced subgraph of G isomorphic ... isomorphic. Consider S, a neighborhood of a vertex v of maximumdegree in G. Then, all subsets of S of size k − 2 induce isomorphic graphs. Therefore,if |S|≥k we have, by Proposition 1, that S induces ... does not have a vertex of degree k −2 or all subgraphs of H on k −1 vertices with a spanning star are isomorphic. Then, by Claim 0, ∆(G) ≤ k −1.Consider a set S of vertices of G inducing H and...