2 problems

Let $f^*(2,3,n)$ denote the random variable measuring the largest number of vertices that can be reached from a vertex by monochromatic directed paths of depth at most $3$ in a two…

Degree-two vertex conjecture. If $s$ has degree at most two, then the events $\{a\to s\}$ and $\{s\to b\}$ are independent or negatively correlated.