Generalized Fitch Graphs II: Sets of Binary Relations that are explained by Edge-labeled Trees

Marc Hellmuth, Carsten R. Seemann, Peter F. Stadler

Fitch graphs $G=(X,E)$ are digraphs that are explained by $\{\varnothing ,1\}$-edge-labeled rooted trees $T$ with leaf set $X$: there is an arc $(x,y)\in E$ if and only if the uniqu…