Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2018_04_08_de_grey: De Grey exhibits finite unit-distance graphs in the plane with no proper 4-coloring, the smallest on 1581 vertices, so the chromatic number of the plane is at least five; refereed, since superseded by the bound six.
2026_05_13_reed: A public manuscript announcing chi(R^2) = 7 through a density bound on unit-independent subsets of a circle; rejected on the release's record that the bound fails for a half-open arc and is assumed by the formal theorem.
2026_09_23_openai: Every coloring of the plane with five colors has two points at distance one of the same color, with no regularity assumed, and seven colors suffice; kernel-checked Lean built and axiom-audited here, a partial claim.