Statements (14)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:describes |
partition properties of graphs
|
| gptkbp:field |
combinatorics
graph theory |
| gptkbp:generalizes |
gptkb:Ramsey's_theorem
|
| https://www.w3.org/2000/01/rdf-schema#label |
Nešetřil–Rödl theorem
|
| gptkbp:namedAfter |
gptkb:Jaroslav_Nešetřil
gptkb:Vojtěch_Rödl |
| gptkbp:publishedIn |
gptkb:Journal_of_Combinatorial_Theory,_Series_B
|
| gptkbp:relatedTo |
gptkb:Ramsey_theory
|
| gptkbp:state |
For every finite graph H and every positive integer r, there exists a finite graph G such that for every r-coloring of the edges of G, there is a monochromatic copy of H in G.
|
| gptkbp:yearProved |
1976
|
| gptkbp:bfsParent |
gptkb:Jaroslav_Nešetřil
|
| gptkbp:bfsLayer |
7
|