Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
1992_07_01_chung: Chung's 1992 edge-partition of the n-cube into four subgraphs without a six-cycle, so a class with a quarter of the edges avoids C_6 and the statement fails for every epsilon at most 1/4; refereed and credited by the site.
1993_03_01_brouwer_dejter_thomassen: An explicit four-coloring of the n-cube's edges with no monochromatic four- or six-cycle, so a color class with a quarter of the edges avoids C_6 and the statement fails for every epsilon at most 1/4; refereed and credited.
Linked from (1)
Graph