Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
1992_01_01_de_caen_szekely: De Caen and Székely prove n^(10/9) >> f(n, floor(n^(2/3))) >> n^(58/57+o(1)) for 4- and 6-cycle-free bipartite graphs, so the answer to Problem 1080 is no; credited by the site's curator, the chapter not held, a Lean file linked.
1994_05_01_lazebnik_ustimenko_woldar: Lazebnik, Ustimenko and Woldar construct 4- and 6-cycle-free bipartite graphs between about n^(2/3) and n vertices with n^(16/15+o(1)) edges, which alone answers Problem 1080 in the negative; refereed in JCTB 61 (1994), not held.
Linked from (1)
Graph