Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
gptkb:Sylvester–Gallai_theorem
|
| gptkbp:category |
unsolved problems in mathematics
theorems in geometry |
| gptkbp:field |
gptkb:geometry
combinatorics |
| https://www.w3.org/2000/01/rdf-schema#label |
Sylvester's problem
|
| gptkbp:proposedBy |
gptkb:James_Joseph_Sylvester
|
| gptkbp:relatedTo |
gptkb:geometry
gptkb:Sylvester–Gallai_theorem incidence geometry |
| gptkbp:sentence |
Given a finite set of points in the plane, not all on a line, prove that there exists a line passing through exactly two of the points.
|
| gptkbp:solvedBy |
gptkb:Melchior
gptkb:Tibor_Gallai |
| gptkbp:yearProposed |
1893
|
| gptkbp:bfsParent |
gptkb:James_Joseph_Sylvester
|
| gptkbp:bfsLayer |
5
|