On the largest strongly connected component of randomly oriented divisor graphs

Jihyung Kim, Tristan Phillips

We introduce the study of \textit{randomly oriented divisor graphs}. For each $\rho \in [0,1]$, the randomly oriented divisor graph ${\mathcal{D}}_{\rho }(N)$ is obtained from the divisor grap…