Two errors in the article Best Match Graphs (Geiß et al. in JMB 78: 2015–2057, 2019) are corrected. One concerns the tacit assumption that digraphs are sink-free, which has to be added as an additional precondition in Lemma 9, Lemma 11, Theorem 4. Correspondingly, Algorithm 2 requires that its input is sink-free. The second correction concerns an additional necessary condition in Theorem 9 required to characterize best match graphs. The amended results simplify the construction of least resolved trees for n-cBMGs, i.e., Algorithm 1. All other results remain unchanged and are correct as stated.

中文翻译：

---

更正“最佳匹配图”

文章最佳匹配图（Geiß等人，JMB 78：2015-2057，2019）中的两个错误已得到纠正。一个问题涉及图是无图的隐性假设，这必须作为引理9，引理11，定理4的附加前提添加。相应地，算法2要求其输入是无宿的。第二个校正涉及定理9中表征最佳匹配图所需的其他必要条件。修改后的结果简化了n -cBMG的最小分辨树的构造，即算法1。所有其他结果保持不变，并且如所述是正确的。