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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bondy J.A., Murty U.S.R.: Graph Theory with Applications. Macmillan, London (1978)
Cockayne E.J., Lorimer P.J.: The Ramsey number of stripes. J. Austral. Math. Soc. 19, 252–262 (1975)
Erdös P., Gyárfás A., Pyber L.: Vertex coverings by monochromatic cycles and trees. J. Combin. Ser. B 51, 90–95 (1991)
Gerencsér G., Gyárfás A.: On Ramsey-type problems, Annales Universtatis Scientarium Budapestinensis Roland Eötvös. Sectio Mathematica X, 167–170 (1967)
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported by Science and Technology Commission of Shanghai Municipality (07XD14011) and Shanghai Leading Discipline Project (Project No.B407). H. Ren was supported by the NSFC of China (10671073).
Rights and permissions
About this article
Cite this article
Cao, N., Ren, H. Exponentially Many Monochromatic n-Matchings in K 3n-1 . Graphs and Combinatorics 28, 309–314 (2012). https://doi.org/10.1007/s00373-011-1051-0
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-011-1051-0