Hoàng-Reed conjecture holds for tournaments (Q932618)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hoàng-Reed conjecture holds for tournaments |
scientific article |
Statements
Hoàng-Reed conjecture holds for tournaments (English)
0 references
11 July 2008
0 references
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.
0 references
tournament
0 references
triangle structure
0 references
digraph
0 references
