Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:concerns |
maximum chromatic number of graphs embeddable on a surface
|
| gptkbp:excludes |
gptkb:Klein_bottle
|
| gptkbp:field |
graph theory
|
| gptkbp:form |
chromatic number = floor((7 + sqrt(1 + 48g))/2) for orientable surface of genus g > 0
|
| gptkbp:generalizes |
four color theorem
|
| gptkbp:proposedBy |
gptkb:Percy_John_Heawood
1890 |
| gptkbp:provenBy |
gptkb:J._W._T._Youngs
gptkb:Gerhard_Ringel 1968 |
| gptkbp:relatedTo |
chromatic number
map coloring |
| gptkbp:status |
proven (except for Klein bottle)
|
| gptkbp:bfsParent |
gptkb:J._W._T._Youngs
|
| gptkbp:bfsLayer |
8
|
| https://www.w3.org/2000/01/rdf-schema#label |
Heawood conjecture
|