Hoàng-Reed conjecture holds for tournaments (Q932618)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5300629
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hoàng-Reed conjecture holds for tournaments |
scientific article; zbMATH DE number 5300629 |
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
0.8091257810592651
0 references
0.808319628238678
0 references
0.7902650237083435
0 references
0.7890973091125488
0 references
