Hoàng–Reed conjecture holds for tournaments

Hoàng–Reed conjecture asserts that every digraph image has a collection image of circuits image, where image is the minimum outdegree of image, such that the circuits of image have a forest-like structure. Formally, image, for all image. We verify this conjecture for the class of tournaments.