1 problem
Forest characterization conjecture. If a tournament has an ordering of its vertices for which the backward arc digraph is a forest, then has the strong Erdős–Hajnal propert…
Forest characterization conjecture. If a tournament has an ordering of its vertices for which the backward arc digraph is a forest, then has the strong Erdős–Hajnal propert…