Skip to content

Erdős problem 24

Does every triangle-free graph on 5n5n vertices contain at most n5n^5 copies of C5C_5?
Retained from Formal Conjectures · not edited here
Formal statements
1 solved
Erdős Problems says
proved (Lean)
Decision here
No current contribution
Checks
0 checks · 1 formal

Current Result

Accepted in Vela Mathematics Program

Current Result

No result has been accepted here yet.

Type
Evidence
0 artifacts
Decision
None
Reviewed
No date retained

Search problems.science

Find a Problem, Result, source, or page