The Gallai-Younger conjecture for planar graphs (Q1375627)
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 1101403
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Gallai-Younger conjecture for planar graphs |
scientific article; zbMATH DE number 1101403 |
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
0.8284287452697754
0 references
0.778550386428833
0 references
0.7711809873580933
0 references
0.761038601398468
0 references
0.7598458528518677
0 references
