Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claim. For positive integers with the rational is a Turán exponent (Theorem 1.2), a strong form of a conjecture of Jiang, Jiang and Ma. In the Bukh--Conlon rooted-graph framework the lower bound is Lemma 1.3, and the paper proves the matching upper bound of the Bukh--Conlon conjecture for the rooted trees of Jiang, Jiang and Ma with (Theorem 1.5), of density . The site's commentary gives the range as . The statements are recorded on the library's source card.
Covers. The instances with , 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. Conlon and O. Janzer, Rational exponents near
two, Adv. Comb. (2022), Paper No. 9, 10 pp., doi:10.19086/aic.2022.9, a
refereed journal. First posting: arXiv:2203.03375, v1 7 March 2022 (the date
this page is named by), v2 13 December 2022. 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.