| Abstract: | Erdös et al and Gerencsér et al had shown that in any 2-edge-coloring of K 3n-1, there is a n-matching containing edges with the same color(we call such matching monochromatic matching). In this paper we show that for any 2-edge-coloring of K 3n-1 there exists a monochromatic subgraph H of K 3n-1 which contains exponentially many monochromatic n-matchings. |
