Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2020_06_19_joret_micek_reed_smid: Corollary 2 of Joret, Micek, Reed and Smid (2021), clique chromatic number O(sqrt(n / log n)), gives tau(G) <= n - c sqrt(n log n) through the largest color class, answering both questions; refereed and credited by the site.
2026_04_21_przemek_chojecki: A four-page note of 21 April 2026 and a Lean file posted on the site's thread derive T(n) = n - Theta(sqrt(n log n)) from the Joret–Micek–Reed–Smid corollary and Kim's theorem, both declared with sorry; unrefereed.
Linked from (1)
Graph