Let H be a fixed graph. For a graph G, we write G ~pr H to denote that G has the property that in every proper coloring of the edges of G there exists a rainbow copy of H, that is, a copy of H in which ali colors are different. ln this thesis, we prove a couple of results about this property in
WARNING - Viewing this document is conditioned on your acceptance of the following terms of use:
This document is only for private use for research and teaching activities. Reproduction for commercial use is forbidden. This rights cover the whole data about this document as well as its contents. Any uses or copies of this document in whole or in part must include the author's name.
Publishing Date
2023-07-27