Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated

Problem 781

../

claims/: The 1 claim page of Problem 781, one per claimant's result; the problem's standing derives from them.


Statement. Let f(k)f(k) be the minimal nn such that any 22-colouring of {1,…,n}\{1,\ldots,n\} contains a monochromatic kk-term descending wave: a sequence x1<⋯<xkx_1<\cdots <x_k such that, for 1<j<k1<j<k,

xj≥xj+1+xj−12.x_j \geq \frac{x_{j+1}+x_{j-1}}{2}.

Estimate f(k)f(k). In particular is it true that f(k)=k2−k+1f(k)=k^2-k+1 for all kk?

Status. Disproved. The status-defining source is Theorem 1.1 of Alon and Spencer [AlSp89] (J. Combin. Theory Ser. A 52 (1989), 275--287, refereed): c1k3≤f(k)≤c2k3c_1k^3\le f(k)\le c_2k^3 for constants c1,c2>0c_1,c_2>0 and all kk, so f(k)=k2−k+1f(k)=k^2-k+1 fails for every large kk and f(k)f(k) is known up to constant factors. Brown, Erdős and Freedman [BEF90] had shown k2−k+1≤f(k)≤(k3−4k+9)/3k^2-k+1\le f(k)\le(k^3-4k+9)/3 and asked whether the lower bound is exact. The claim page is Alon and Spencer (accepted on the refereed publication and the site's credit).

Source. erdosproblems.com/781, accessed 2026-10-07 (no last-edited date; empty discussion thread and proof-claim tab). Cite as: T. F. Bloom, Erdős Problem #781, https://www.erdosproblems.com/781.

References.

  • [AlSp89] Alon, N. and Spencer, Joel, Ascending waves. J. Combin. Theory Ser. A 52 (1989), no. 2, 275-287, doi:10.1016/0097-3165(89)90033-2 (Crossref record read); held.
  • [BEF90] Brown, T. C. and Erdős, P. and Freedman, A. R., Quasi-progressions and descending waves. J. Combin. Theory Ser. A 53 (1990), no. 1, 81-95, doi:10.1016/0097-3165(90)90021-N (Crossref record read); held.

Formalization. The statement is in formal-conjectures (file added 2026-09-20) in two parts: erdos_781.parts.i states that f(k)f(k) has the order of k3k^3, and erdos_781.parts.ii states that f(k)=k2−k+1f(k)=k^2-k+1 for all k≥1k\ge1, with answer false; both are tagged research solved and name line 3202 of src/latest/ErdosProblems/Erdos781.lean of Boris Alexeev's lean-proofs repository as their formal proof, and the file states the Brown–Erdős–Freedman bounds as a variant without proof. That development (3,223 lines; first added 2026-08-17; informal authors Alon and Spencer, formal authors Codex and GPT-5.6 Sol) proves in its theorem erdos_781 that k3≤248f(k)k^3\le2^{48}f(k) and f(k)≤8k3+1f(k)\le8k^3+1 for all k≥250k\ge2^{50} and that f(k)=k2−k+1f(k)=k^2-k+1 does not hold for all kk; it is pinned on the claim page. The community database (teorth/erdosproblems) lists status disproved as of its last update on 2025-08-31, formal_status unformalized and formalized yes since 2026-09-20. The corpus has not built the development, so no formalized evidence is listed.

Progress

Not yet compiled.

Known Results

Not yet compiled.

Linked library material

These entries are derived from explicit links on library pages. They are navigation only and do not by themselves record mathematical progress.