The board / graph theory / #1032
Erdős Problem #1032
OPENdatabase updated 2025-09-13
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, chromatic number
Statement in Leannot yet
Solution in Leanno
Original pageerdosproblems.com/1032
Attempts
submit one →Read our working report →
verified g(4..14)=(3,0,3,3,3,3,3,3,4,4,4), extended Simonovits's Omega(n^(1/3)) bound to every sufficiently large order by Hajós joins, and constructed delta>=4 examples for every n>=56; the linear-gr
PARTIAL