Graphs and Combinatorics

, Volume 28, Issue 3, pp 309–314 | Cite as

Exponentially Many Monochromatic n-Matchings in K3n-1

Original Paper

Abstract

Erdös et al and Gerencsér et al had shown that in any 2-edge-coloring of K3n-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 K3n-1 there exists a monochromatic subgraph H of K3n-1 which contains exponentially many monochromatic n-matchings.

Keywords

2-Edge-coloring Monochromatic subgraph 1-Factor 

Mathematics Subject Classification (2010)

05C15 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bondy J.A., Murty U.S.R.: Graph Theory with Applications. Macmillan, London (1978)Google Scholar
  2. 2.
    Cockayne E.J., Lorimer P.J.: The Ramsey number of stripes. J. Austral. Math. Soc. 19, 252–262 (1975)MathSciNetMATHCrossRefGoogle Scholar
  3. 3.
    Erdös P., Gyárfás A., Pyber L.: Vertex coverings by monochromatic cycles and trees. J. Combin. Ser. B 51, 90–95 (1991)MATHCrossRefGoogle Scholar
  4. 4.
    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)Google Scholar

Copyright information

© Springer 2011

Authors and Affiliations

  1. 1.Mathematics Department of East China Normal UniversityShanghaiPeople’s Republic of China

Personalised recommendations