“…The dual cone C G consists of all partial matrices T ∈ R E with entries in positions (i, j) ∈ E, which can be extended to a full positive definite matrix. So, maximum likelihood estimation in Gaussian graphical models corresponds to the classical positive definite matrix completion problem (Barrett et al 1993;Grone et al 1984;Barrett et al 1996;Laurent 2001b). In this section we investigate our three guiding questions, first for chordal graphs, next for the chordless m-cycle C m , then for all graphs with five or less vertices, and finally for the m-wheel W m .…”