Threshold for anti-Ramsey properties
In this text we study results centered on the definition of the threshold for the anti-Ramsey Property, approaching some existing results, both of the $0$-statement and $1$-statement types. This is a bibliographical study of these results that contains different proof techniques and compiles part of the contributions of several researchers to this sub-area of Extreme Combinatorics.
Let $G$ and $H$ be graphs and let $G\rightarrow^{rb}_p H$ denote the property that, for every {\it proper edge-colouring} of $G$ there is a {\it rainbow} copy of $H$ in $G$. We say that a copy of $H$ is rainbow when there is not more than one edge with the same color in $H$.
In this text we study results focused in defining the threshold function ($p^{rb}_H = p^{rb}_H(n)$) for the property $G\rightarrow^{rb}_p H$.