Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2018_06_11_dvorak_hu_sereni: Theorem 2 of Dvořák, Hu and Sereni (Advances in Combinatorics 2019) gives a graph that is 4-choosable but not (8,2)-choosable, a counterexample at m = 2; accepted on the refereed publication and the site's credit.
Linked from (1)
Graph