Every strong digraph has a spanning strong subgraph with at most \(n+2\alpha-2\) arcs (Q1405121): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 04:16, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Every strong digraph has a spanning strong subgraph with at most \(n+2\alpha-2\) arcs |
scientific article |
Statements
Every strong digraph has a spanning strong subgraph with at most \(n+2\alpha-2\) arcs (English)
0 references
25 August 2003
0 references
The authors prove that every strong digraph \(D\) with \(n\) vertices and independence number \(\alpha\) has a spanning strong subgraph with at most \(n+2\alpha- 2\) arcs. Such a spanning subgraph can be found in polynomial time. This result implies that \(D\) is spanned by at most \(2\alpha-1\) directed cycles. In 1964 Tibor Gallai conjectured that \(\alpha\) directed cycles are enough.
0 references
directed cycles
0 references