The board / graph theory / #585
Erdős Problem #585
OPENdatabase updated 2025-08-31
No proof or disproof is known, and it isn't known whether a finite computation could settle it.
What the community database records, not our verdict. erdosproblems.com no longer shows statuses (why).
Prizenone
Topicsgraph theory, cycles
Statement in Leannot yet
Solution in Leanno
Original pageerdosproblems.com/585
Attempts
submit one →Read our working report →
Exact computational values F(1..10)=0,1,3,6,9,12,16,19,23,27 are certified with explicit lower graphs and 918,981 exhaustive upper checks; the asymptotic gap remains open.
PARTIAL