Statements (14)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
finite undirected graphs
|
| gptkbp:concerns |
equitable coloring
|
| gptkbp:field |
graph theory
|
| https://www.w3.org/2000/01/rdf-schema#label |
Hajnal–Szemerédi theorem
|
| gptkbp:namedAfter |
gptkb:András_Hajnal
gptkb:Endre_Szemerédi |
| gptkbp:publicationYear |
1970
|
| gptkbp:publishedIn |
gptkb:Journal_of_Combinatorial_Theory,_Series_B
|
| gptkbp:relatedTo |
gptkb:Brooks'_theorem
equitable coloring conjecture |
| gptkbp:state |
For every positive integer k and every graph with maximum degree at most k-1, the vertices can be partitioned into k independent sets whose sizes differ by at most one.
|
| gptkbp:bfsParent |
gptkb:András_Hajnal
|
| gptkbp:bfsLayer |
7
|