1 problem

Lauritzen's conjecture. The graph $G$ is $n$-estimable if and only if