Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
1975_01_01_erdos_lovasz: Theorem 8 of Erdős and Lovász (1975) bounds the largest number of points of a 3-chromatic r-uniform clique below by (1/2)C(2r-2,r-1)+2r-2, so the first question's O(r^2) bound fails; a proceedings result, claimed.
Linked from (1)
Graph