Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2020_06_01_janzer: Janzer's bound for the r-blow-up of a long even cycle, bipartite with minimum degree 2r, lies below the problem's exponent; the site credits it with the disproof for even minimum degree at least 4; Israel J. Math. 253 (2023).
2021_09_13_janzer: Janzer's Theorem 1.4 gives, for every positive eta, a 3-regular bipartite graph with extremal number at most n to the four thirds plus eta, below the problem's exponent at minimum degree three; refereed in IMRN 2023.
Linked from (1)
Graph