Hoàng-Reed conjecture holds for tournaments
Hoàng-Reed conjecture states that every digraph has a collection of \(m\) circuits, where \(m\) is the minimum out-degree of the digraph, such that these circuits have a forest-like structure. The purpose of the paper is to verify the conjecture for the class of tournaments.
scientific article; zbMATH DE number 5300629