Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claim. For integers with the rational is a Turán exponent (Theorem 1.4), which subsumes the families , and known before it; Corollary 1.5 deduces that every is a limit point of the Turán exponents. The paper also proposes a conjecture on -subdivisions of bipartite graphs and shows that it implies the full statement of Problem 571; that implication is not a claim. The statements are recorded on the library's source card.
Covers. The instances with and , each realized by a single bipartite graph. The statement for every rational is settled by the accepted claim page Adamczewski 2026.
Depends on. Nothing in this wiki; the result is the paper's own theorem.
Acceptance. Refereed: D. Y. Kang, J. Kim and H. Liu, On the rational Turán
exponents conjecture, J. Combin. Theory Ser. B 148 (2021), 149--172,
doi:10.1016/j.jctb.2020.12.003, a refereed journal. First posting:
arXiv:1811.06916, v1 16 November 2018 (the date this page is named by). No
reviewed evidence is listed: the site's commentary lists these exponents
among the Turán exponents known before 2026 and credits the paper, but its
label credits GPT-6 Astra with the full proof and is not an acceptance of this
result.
Read depth. The statements are taken from the paper's abstract and the result list on the library card; no proof was read, and nothing is independently reviewed in this corpus.