PPL 078 / 177 permanent IDsPrize Problem Ledger · PPLChecked 2026.07.26
Prize Problem LedgerPPL · Open reward indexAll 177 problems
Prize Problem LedgerErdősPPL 078Erdős Problem #713

Permanent problem IDPPL 078

Verified openErdősconjecture

Graph theory

Erdős Problem #713

Is it true that, for every bipartite graph G, there exists some α∈ [1,2) and c>0 such that ex(n;G)\sim cn^α? Must α be rational?

graph theoryturan number
01

The problem

Is it true that, for every bipartite graph G, there exists some α∈ [1,2) and c>0 such that ex(n;G)\sim cn^α? Must α be rational?

Open since1970exact
Last checked2026.07.26Catalog verification
02

Reward offers

Offer 01$500Paul Erdős / Combinatorics Foundation
Documented

A solution must appear in a reputable journal, with documentation that Erdős offered the displayed amount. Claims are administered by the Combinatorics Foundation; erdosproblems.com does not pay awards.

Award source ↗Rules ↗
03

Sources & reading

2 unique reference linksCanonical problem page Claim or award rules
04

Related open targets

Graph theoryKrenn-Gu conjecturePPL 109 · €3,000 · 8 years openGraph theoryErdős Problem #625PPL 068 · $1000 · 37 years openGraph theoryErdős Problem #146PPL 045 · $500 · 42 years open