Schaller, David; Manuela Geiß; Edgar Chavez; Marcos Gonzalez Laffitte; Alitzel Lopez Sanchez; Baerbel M. R. Stadler; Dulce I. Valdivia; Marc Hellmuth; Maribel Hernandez Rosales and Peter F. Stadler
Two errors in the article Best Match Graphs (Geiss 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.