Erdős problem 24 · problems.science

Does every triangle-free graph on $5n$ vertices contain at most $n^5$ copies of $C_5$ ?

Workspace

Open this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.

Canvas

public preview

Work these sources record against this Problem. Source-reported attribution, not reviewed here.

Formalization
Erdős AI contributions wiki · 23 Apr-26 May, 2026
Machine
Aristotle
Open the source record