Properly coloured copies and rainbow copies of large graphs with small maximum degree

Julia Böttcher, Yoshiharu Kohayakawa, Aldo Procacci

Let G be a graph on n vertices with maximum degree D. We use the Lovász local lemma to show the following two results about colourings c of the edges of the complete graph K_n. If…