Statements (13)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
finite undirected graphs
|
| gptkbp:concerns |
chromatic number
clique number maximum degree |
| gptkbp:field |
graph theory
|
| https://www.w3.org/2000/01/rdf-schema#label |
Reed's conjecture
|
| gptkbp:proposedBy |
gptkb:Bruce_Reed
|
| gptkbp:sentence |
The chromatic number of a graph is at most the ceiling of (Δ + 1 + ω)/2, where Δ is the maximum degree and ω is the clique number.
|
| gptkbp:status |
open
|
| gptkbp:yearProposed |
1998
|
| gptkbp:bfsParent |
gptkb:Graph_coloring_problem
|
| gptkbp:bfsLayer |
6
|