On converse invariant trees of diameter four

Fernando Afonso, Lucas Colucci, Tássio Naia

Let $D$ be an oriented graph, and let $f_T(D)$ denote the number of copies of $D$ in a tournament $T$. We say that $D$ is \emph{converse invariant} if $f_T(D)=f_T(\overline{D})$ for…