Mangoes and blueberries (Q1125684): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Bruce A. Reed / rank | |||
| Property / author | |||
| Property / author: Bruce A. Reed / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s004930050056 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1514063965 / rank | |||
Normal rank | |||
Latest revision as of 00:22, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Mangoes and blueberries |
scientific article |
Statements
Mangoes and blueberries (English)
0 references
20 December 1999
0 references
The author proves a rather innocent looking conjecture of P. Erdős and A. Hajnal. Namely, for every integer \(k\) there is a number \(f(k)\) such that if for a graph \(G\), every subgraph \(H\) of \(G\) has a stable set containing \((v(H)-k)/2\) vertices, then \(G\) contains a set \(X\) of at most \(f(k)\) vertices such that \(G \setminus X\) is bipartite. The proof is surprisingly hard and technical, and the upper bound on \(f(k)\) is huge.
0 references
bipartite graphs
0 references
packing
0 references
odd cycles
0 references
