The Gallai-Younger conjecture for planar graphs (Q1375627): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q123305356, #quickstatements; #temporary_batch_1706368214787 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:11, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Gallai-Younger conjecture for planar graphs |
scientific article |
Statements
The Gallai-Younger conjecture for planar graphs (English)
0 references
7 January 1998
0 references
Younger conjectured that for every \(k\) there is a \(g(k)\) such that any digraph without \(k\) vertex disjoint cycles contains a set of at most \(g(k)\) vertices whose removal leaves an acyclic digraph. (This has previously been conjectured by Gallai for \(k=1\).) The authors prove this for planar digraphs. More recently the general conjecture has been resolved by Reed, Robertson, Seymour and Thomas.
0 references
