Erdős–Gyárfás conjecture

record target F0 no formal statement

No formal proof attached. Any claim here rests on a write-up or a report.

Fidelity F0: Absent. No formal statement is attached to the result.

Let $G$ be a finite graph with minimum degree at least $3$. Must $G$ contain a cycle of length $2^k$ for some $k \\geq 2$?

AI activity

AlphaEvolve

5 Nov 2025

unstated A2 V1 F0

Reasoning and sources

An evolutionary coding agent searching against an evaluator written by people, who also chose the problems.

F0 no formal statement. Absent. No formal statement is attached to the result.

Follow this problem

An email when it has a new claim, check, bounty or discussion. You confirm once and can stop with one click.

Discussion and bounties for this problem load here.

Something wrong or missing here? Request a correction or add a claim, with its sources.

qed.bot, “Erdős–Gyárfás conjecture”, https://qed.bot/t/alphaevolve-51, as of 30 Sep 2026.

This record as plain text, with each claim, its grades and its sources.