We’re sorry, something doesn't seem to be working properly.
Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.
Abstract
Erdös et al and Gerencsér et al had shown that in any 2-edge-coloring ofK3n-1, there is an-matching containing edges with the same color(we call such matchingmonochromatic matching). In this paper we show that for any 2-edge-coloring ofK3n-1 there exists a monochromatic subgraphH ofK3n-1 which contains exponentially many monochromaticn-matchings.
This is a preview of subscription content,log in via an institution to check access.
Access this article
Subscribe and save
- Get 10 units per month
- Download Article/Chapter or eBook
- 1 Unit = 1 Article or 1 Chapter
- Cancel anytime
Buy Now
Price includes VAT (Japan)
Instant access to the full article PDF.
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. B51, 90–95 (1991)
Gerencsér G., Gyárfás A.: On Ramsey-type problems, Annales Universtatis Scientarium Budapestinensis Roland Eötvös. Sectio MathematicaX, 167–170 (1967)
Author information
Authors and Affiliations
Mathematics Department of East China Normal University, Shanghai, 200062, People’s Republic of China
Ni Cao & Han Ren
- Ni Cao
You can also search for this author inPubMed Google Scholar
- Han Ren
You can also search for this author inPubMed Google Scholar
Corresponding author
Correspondence toHan Ren.
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 Monochromaticn-Matchings inK3n-1 .Graphs and Combinatorics28, 309–314 (2012). https://doi.org/10.1007/s00373-011-1051-0
Received:
Revised:
Published:
Issue Date:
Share this article
Anyone you share the following link with will be able to read this content:
Sorry, a shareable link is not currently available for this article.
Provided by the Springer Nature SharedIt content-sharing initiative