Authors: Ni Cao Han Ren
Publish Date: 2011/05/10
Volume: 28, Issue: 3, Pages: 309-314
Abstract
Erdös et al and Gerencsér et al had shown that in any 2edgecoloring of K 3n1 there is a nmatching containing edges with the same colorwe call such matching monochromatic matching In this paper we show that for any 2edgecoloring of K 3n1 there exists a monochromatic subgraph H of K 3n1 which contains exponentially many monochromatic nmatchings
Keywords: