The Gallai-Younger conjecture for planar graphs (Q1375627): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: A note on short cycles in digraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4273847 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Disjoint cycles in digraphs / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01271273 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1980526181 / rank | |||
Normal rank | |||
Latest revision as of 09:49, 30 July 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
