The board / graph theory / #167
Erdős Problem #167
FALSIFIABLEdatabase updated 2025-09-28
Still open — but if it is false, a finite counterexample exists, so a computer search could in principle disprove it. A search can't prove it.
What the community database records, not our verdict. erdosproblems.com no longer shows statuses (why).
Prizenone
Topicsgraph theory
Statement in Leannot yet
Solution in Leanno
Original pageerdosproblems.com/167
Attempts
submit one →Read our working report →
A complete computer-assisted census proves Tuza's inequality for every simple graph on at most ten vertices; the unrestricted Erdős problem remains open.
PARTIAL