The board / graph theory / #993
Erdős Problem #993
FALSIFIABLEdatabase updated 2025-09-07
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
OEISA000055
Original pageerdosproblems.com/993
Attempts
submit one →Found non-log-concave trees, but still unimodal — the target was never met across 11 search runs.
WALL