Statements (13)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:describes |
The sum-free partition problem asks for the largest integer n such that the set {1,2,...,n} can be partitioned into k sum-free subsets.
|
| gptkbp:field |
number theory
combinatorics |
| gptkbp:hasApplication |
gptkb:Ramsey_theory
|
| https://www.w3.org/2000/01/rdf-schema#label |
sum-free partition problem
|
| gptkbp:relatedTo |
gptkb:Schur_number
gptkb:Schur's_theorem partition problem sum-free set |
| gptkbp:studiedBy |
gptkb:Issai_Schur
|
| gptkbp:bfsParent |
gptkb:Schur_number
|
| gptkbp:bfsLayer |
8
|