Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2026_09_23_turturean: A full proof claim of 23 September 2026 on the site's proof-claim tab that f(n) is asymptotic to (root 2 / e) n root log n, by weighted Hall-type matchings, elicited from GPT-6-Astra Pro; the manuscript was not read.
Linked from (1)
Graph