Claimempirical · verifiableA factual claim that could be checked directly against observation or primary records.constitution →importance · settledImportance 0.20, 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 →

TopicsErdős–Szekeres monotone subsequence theorem Combinatorics

Every sequence of k^2+1 distinct reals has a monotone subsequence of length k+1, and k^2+1 is optimal.

Not yet assessed. Attention goes where its expected value is highest and someone funds it; nothing has funded an assessment of this claim yet, and anyone can.

Decomposition

This claim has not been assessed yet. Attention goes where its expected value is highest and someone funds it; once this claim's assessment is funded and runs, it may well decompose into subclaims.

or create a grant for this whole area →

Provenance

Where this claim has been said, linked to its canonical form.

1 source · no origin · 1 untraced

1 Untraced

The story of Erdős problem #1026Dec 9, 2025 Untraced · nothing upstream recorded

given a sequence of {k^2+1} distinct real numbers, one can find a subsequence of length {k+1} which is either increasing or decreasing; and that one cannot improve the {k^2+1} to {k^2}

The story of Erdős problem #1026extraction 0.95

Tao recalling the Erdős–Szekeres theorem in the introduction of the problem's history.

Cite this claim: a formal citation with its evidence attached

Embed this claim: show it on another site with its current assessment

An embed reports the graph's judgment as it stands when the page is viewed: the status with its confidence, how disputed the claim is, and the date. It links back here.

CardFits its column and sizes itself. Without the script it stays a quotation with its link.

<blockquote class="minerval-claim" data-claim-id="77f9eb05-1955-460d-93a7-6f354d05aead"><a href="https://minerval.ai/claims/77f9eb05-1955-460d-93a7-6f354d05aead">Every sequence of k^2+1 distinct reals has a monotone subsequence of length k+1, and k^2+1 is optimal.</a></blockquote>
<script async src="https://minerval.ai/embed.js"></script>

IframeWhere scripts are not allowed. A fixed height; add ?theme=light or ?theme=dark to fix its colours.

<iframe src="https://minerval.ai/embed/claims/77f9eb05-1955-460d-93a7-6f354d05aead" title="Minerval: Every sequence of k^2+1 distinct reals has a monotone subsequence of length k+1, and k^2+…" width="480" height="200" style="border:0;max-width:100%" loading="lazy"></iframe>

BadgeAn image for a README or a forum post, in Markdown.

[![Minerval's judgment of this claim](https://minerval.ai/embed/claims/77f9eb05-1955-460d-93a7-6f354d05aead/badge.svg)](https://minerval.ai/claims/77f9eb05-1955-460d-93a7-6f354d05aead)

The badge now:

Contribute

Every judgment on this page is open to challenge. A contribution is evaluated on its merits by the reviewer; if it succeeds the page changes, and if it does not, the reasons are stated. Either way the exchange becomes part of the claim’s public record.

Created by extractor · Sep 13, 2026. Every judgment on this page is accompanied by a reasoning trace.