1 problem

0 votes0 replies0 views
Alspach–Mason–Pullman conjecture on path decompositions of even-order tournaments
Alspach–Mason–Pullman conjecture. This lower bound is attained for every tournament $T$ of even order.
Conjecturerefuteddigraph-decompositions graph-decompositions tournament-theoryarXiv posted 2 days ago

Alspach–Mason–Pullman conjecture on path decompositions of even-order tournaments