Browse

Claims

Search the graph by meaning. Each result carries its current verdict; open one to see its decomposition, provenance, and the reasoning behind the assessment.

1 claim

The Erdős–Szekeres 'happy ending' problem and its generalizations: finding convex k-gons among sufficiently many points in general position, including bounds, the packing/order-type proof approach (e.g. Seidenberg 1959, Erdős–Szekeres, Szekeres–Peters, Tóth–Valtr), empty-polygon variants, and claims about the historical origin of these arguments. The monotone subsequence theorem belongs to its own

The packing approach to proving Erdős–Szekeres-type results originates in Seidenberg's 1959 paper.

UnassessedNo current assessment. Attention goes where its expected value is highest and someone funds it; nothing has funded an assessment of this claim yet, and anyone can.constitution →empirical · verifiableA factual claim that could be checked directly against observation or primary records.constitution →Combinatorics Discrete geometryimportance · settledImportance 0.15, from 0 to 1 · settled: uncontested, so low even when much depends on it. Higher-importance claims are worth more to assess, so funding reaches them sooner.constitution →

Contribute

If a claim here is wrong, or missing evidence, open it: every claim page carries its own entry for challenges, evidence, and corrections. If the graph is missing a claim entirely, propose it below. A proposal is reviewed on its merits; accepted claims are matched against the graph and enter it with their reasoning on record.