Triangle-free graphs with large chromatic numbers (Q1969797): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:40, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Triangle-free graphs with large chromatic numbers |
scientific article |
Statements
Triangle-free graphs with large chromatic numbers (English)
0 references
15 September 2000
0 references
It is shown that there are two positive constants \(c_1, c_2\) such that the maximum possible chromatic number of a triangle-free graph with \(m>1\) edges is at most \(c_1m^{1/3}/(\log m)^{2/3}\) and at least \(c_2m^{1/3}/(\log m)^{2/3}\). This settles a problem of Erdős.
0 references
triangle-free graphs
0 references
chromatic number
0 references
