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

Permanent problem IDPPL 081

Verified openErdősconjecture

Graph theory

Erdős Problem #78

Give a constructive proof that R(k)>C^k for some constant C>1.

graph theoryramsey theory
01

The problem

Give a constructive proof that R(k)>C^k for some constant C>1.

Open since1969source estimate
Last checked2026.07.26Catalog verification
02

Reward offers

Offer 01$100Paul 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

3 unique reference linksCanonical problem page Claim or award rules OEIS A059442
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