Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated

Claims

../

2026_09_29_chao_huang_liu: An arXiv preprint of Chao, Huang and Liu claims the limit of exr(n,F)/nt\mathrm{ex}_r(n,\mathcal F)/n^t whenever k=(r−t)s+tk=(r-t)s+t with r>t≥2r>t\ge2, in closed form depending on the parity of ss, except for 33-graphs with even ss, where it shows for s≥4s\ge4 that the limit exceeds 1/61/6. This answers the problem to first order on that family only.