Abstract
We prove that for all epsilon>0 there are alpha>0 and n(0)is an element of N such that for all n >= n(0) the following holds. For any two-coloring of the edges of Kn, n, n one color contains copies of all trees T of order t
| Original language | English |
|---|---|
| Pages (from-to) | 264-300 |
| Number of pages | 37 |
| Journal | Journal of Graph Theory |
| Volume | 69 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 1 Mar 2012 |