2 problems

For the rainbow-connectivity game $\mathcal{C}_{s,n}$, let $b_{\mathcal{C}_{s,n}}$ denote its threshold bias. Assume that $s=\omega(\log(n))$. Rainbow-connectivity threshold conjec…

Proposed threshold conjecture. The function $p(n)$ is a sharp threshold for the graph property $\mathcal{R}_r$.