Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

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.

share|cite|improve this question
    
Edge coloring. Fixed. – Pavel Aug 24 '12 at 17:24
2  

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.