The board / graph theory / #84
Erdős Problem #84
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
OEISA399654
Original pageerdosproblems.com/84
Attempts
submit one →Read our working report →
certified 247 distinct cycle sets on 11 vertices, so f(11)>=247; reproduced exact f(1..10), but the required unbounded-factor lower bound remains open.
PARTIAL