Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2024_10_03_janzer_steiner_sudakov: Graphs of fractional chromatic number about log log n / log log log n with no 4-regular subgraph, hence no two edge-disjoint cycles on one vertex set, so no f(k) exists even for k = 2; refereed in Bull. London Math. Soc.
Linked from (1)
Graph