2 problems

Extremal ML threshold relation. For any undirected graph $G$,

Dependently rigidity conjecture. The maximum likelihood threshold of $G$ is greater than $n$ if and only if $G$ is generically $n$-dependently rigid.