Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2026_06_23_li: Claims that a finite triple system occurs in every uncountably chromatic triple system exactly when, isolated vertices removed, it is linear, every edge-node of its Levi graph lies on a bridge and every Berge cycle is even.
2026_07_15_petkov: Claims the same characterization of the finite triple systems forced by uncountable chromatic number as Li's preprint, by an alternative proof with its own Lean development that reuses Li's framework for the converse.
Linked from (1)
Graph