Statements (13)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:concerns |
chromatic number
triangle-free graphs |
| gptkbp:field |
graph theory
|
| https://www.w3.org/2000/01/rdf-schema#label |
Mycielski theorem
|
| gptkbp:namedAfter |
gptkb:Jan_Mycielski
|
| gptkbp:publicationYear |
1955
|
| gptkbp:publishedIn |
gptkb:Colloquium_Mathematicum
|
| gptkbp:relatedTo |
Mycielskian construction
|
| gptkbp:state |
For every integer k ≥ 2, there exists a triangle-free graph with chromatic number k.
|
| gptkbp:usedIn |
construction of graphs with high chromatic number and no triangles
|
| gptkbp:bfsParent |
gptkb:Jan_Mycielski
|
| gptkbp:bfsLayer |
8
|