Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2026_09_24_knt: A proof claim on the site's tab asserts h(n) = log_2 n + log_* n + O(1) for the minimum excess of a pancyclic graph, answering the question yes, with a write-up and a Lean 4 development; unreviewed and not built in this corpus.
Linked from (1)
Graph