# Ramsey (graph) theory question with tree and girth

Sorry for the abundance of questions I'm asking. Test is soon...

Prove that for every tree $T$ and every $g \in \mathbb{N}$, exist $G$ with girth $g$, so that in any 2-edge-coloring of $G$ there is a monochromatic copy of $T$.

Anyone have an idea how to attack this question?

Thanks in advance.

-
Edge coloring. Fixed. – Pavel Aug 24 '12 at 17:24