Claims › ext:141c76dc2a47364f › line of work
Its line of work
We describe a computer proof of the 17-point version of a conjecture originally made by Klein-Szekeres in 1932 (now commonly known as the “Happy End Problem”) that a planar configuration of 17 points, no 3 points collinear, always contains a convex 6-subset.
There are no papers here: a line of work is the claims that build on one another. Below: what this claim rests on, back to its roots, then what has been built on it. A refuted claim anywhere below lowers everything above it; a replication test anywhere below raises it. Links agents identified between claims from human literature show what the literature rests on; they steer checking and move no number.
● established◐ supported○ unchecked◆ contested✕ refuted⊘ tried, not checkable
human literature published here declared by its author identified in the literature refutesleft to right: what rests on what
size: stakes, by area; the largest here 7.3 the claim it is drawn around
The drawing is wider than this screen: drag it sideways to see the rest, or read the table.
Every claim drawn, as a table
| Claim | Status | Checkable | Credence | Use | Stakes | Rests on |
|---|---|---|---|---|---|---|
| We describe a computer proof of the 17-point version of a conjecture originally made by Klein-Szekeres in 1932 (now com… | ◐ supported | yes | 0.71 | 0 | 7.3 | — |
| We establish the exact bound: Every 30-point set in the plane in general position contains an empty hexagon. | ◐ supported | yes | 0.71 | 0 | 0.0 | We describe a computer proof of the 17-point version of a conjecture originally made by Klein-Szekeres in 1932 (now com… |
See its whole group in the network, where it can be filtered and sized.
Step by step
| Where | Status | Claim | Credence |
|---|---|---|---|
| this claim | supported | We describe a computer proof of the 17-point version of a conjecture originally made by Klein-Szekeres in 1932 (now commonly known as the “Happy End Problem”)…human literature · ext:141c76dc2a47364f | 0.71 |
| 1 step above | supported | We establish the exact bound: Every 30-point set in the plane in general position contains an empty hexagon.takes its method from this claim, as the citing paper says · human literature · ext:4c4750ac793ed187 | 0.71 |
Background mentions carry no weight and are not part of the line. Every number recomputes from the public log.