The board / graph theory / #738
Erdős Problem #738
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, chromatic number
Statement in Leannot yet
Solution in Leanno
Original pageerdosproblems.com/738
Attempts
submit one →Read our working report →
The open problem is not solved; an independently rerun exhaustive census proves the exact values of \(M_{13}(T)\) for every 6- and 7-vertex tree, with explicit 4-chromatic graph6 witnesses and a preci
PARTIAL