3 problems

Let $G$ be a random graph generated according to the Erdős–Rényi model $G(n,c/n)$, where $c$ is a fixed positive real number, and let $d$ be the minimum integer such that $G$ is…

Let $G$ be a graph with at least one edge. An orientation of $G$ is acyclic if it has no directed cycles, and a cycle is stretched when it has the form…

Let $G(n,c/n)$ be an Erdős–Rényi random graph with fixed $c>0$. Write $\operatorname{mlt}(G)$ for its maximum likelihood threshold and $\operatorname{gcr}(G)$ for its generic compl…