Wiki
Wiki

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

Updated

Claims

../

2025_12_24_alexeev: Boris Alexeev's forum comment of December 2025, crediting Aristotle, refutes the wording for alpha below one third with a clique on slightly more than n^((1+alpha)/2) vertices; the site credits JunGao's witness.

2025_12_28_jungao: A forum comment of December 2025: a complete bipartite graph with a side of about n^alpha vertices caps almost-regular subgraphs at order n^alpha, refuting the wording for alpha below one half; adopted by the site's curator.

2026_08_16_alexeev: A Lean 4 file in Boris Alexeev's lean-proofs repository, credited to GPT-5.6 Sol and Codex, refutes the formal statement of Problem 1077, and so the printed wording, at alpha one quarter; accepted on Lean built here.