Skip to main content
Log in

Sub-Ramsey Numbers for Matchings

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

Given a graph G and a positive integer k, the sub-Ramsey number sr(Gk) is defined to be the minimum number m such that every \(K_{m}\) whose edges are colored using every color at most k times contains a subgraph isomorphic to G all of whose edges have distinct colors. In this paper, we will concentrate on \(sr(nK_{2},k)\) with \(nK_{2}\) denoting a matching of size n. We first give upper and lower bounds for \(sr(nK_{2},k)\) and exact values of \(sr(nK_{2},k)\) for some n and k. Afterwards, we show that \(sr(nK_{2},k)=2n\) when n is sufficiently large and \(k<\frac{n}{8}\) by applying the Local Lemma.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2

Similar content being viewed by others

References

  1. Albert, M., Frieze, A., Reed, B.: Multicoloured Hamilton cycles. Electron J. Combin. 2, \(\sharp \) R10 (1995)

  2. Alon, N., Caro, Y., Tuza, Z.: Sub-Ramsey numbers for arithmetic progressions. Gr. Combin. 5(4), 307–314 (1989)

    Article  MathSciNet  Google Scholar 

  3. Alspach, B., Gerson, M., Hahn, G., Hell, P.: On sub-Ramsey numbers. Ars Combin. 22, 199–206 (1986)

    MathSciNet  MATH  Google Scholar 

  4. Axenovich, M., Martin, R.: Sub-Ramsey numbers for arithmetic progressions. Gr. Combin. 22(3), 297–309 (2006)

    Article  MathSciNet  Google Scholar 

  5. Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. Macmillan London and Elsevier, New York (1976)

    Book  Google Scholar 

  6. Chen, H., Li, X., Tu, J.: Complete solution for the rainbow numbers of matchings. Discret. Math. 309, 3370–3380 (2009)

    Article  MathSciNet  Google Scholar 

  7. Cockayne, E.J., Lorimer, P.J.: The Ramsey number for stripes. J. Aust. Math. Soc. 19(2), 5 (1975)

    Article  MathSciNet  Google Scholar 

  8. Erdős, P., Nestril, J., Rödl, V.: Some Problems Related to Partitions of Edges of a Graph in Graphs and Other Combinatorial Topics, pp. 54–63. Teubner, Leipzing (1983)

    Google Scholar 

  9. Fraisse, P., Hahn, G., Sotteau, D.: Star sub-Ramsey numbers. Discret. Math. 149(2), 153–163 (1987)

    MathSciNet  MATH  Google Scholar 

  10. Frieze, A., Reed, B.: Polychromatic Hamilton cycles. Discret. Math. 118(1–3), 69–74 (1993)

    Article  MathSciNet  Google Scholar 

  11. Fujita, S., Magnant, C., Ozeki, K.: Rainbow generalizations of Ramsey theory—a dynamic survey, Theory Appl. Gr. 0(1) (2014)https://doi.org/10.20429/tag.2014.000101

  12. Galvin, F.: Advanced problem number 6034. Am. Math. Mon. 82, 529 (1975)

    Google Scholar 

  13. Hahn, G.: Anti-Ramsey numbers: an introduction. M.Sc. thesis, Simon Fraser University, Burnaby, BC (1977)

  14. Hahn, G.: More star sub-Ramsey numbers. Discret. Math. 34(2), 131–139 (1981)

    Article  MathSciNet  Google Scholar 

  15. Hahn, G., Thomassen, C.: Path and cycle sub-Ramsey numbers and an edge colouring conjecture. Discret. Math. 62(1), 29–33 (1986)

    Article  MathSciNet  Google Scholar 

  16. Hell, P., Jose, J., Montellano-Ballesteros, : Polychromatic cliques. Discret. Math. 285(1–3), 319–322 (2004)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

Supported by NSFC (nos. 11671320, 11601429 and U1803263) and the Fundamental Research Funds for the Central Universities (no. 3102019GHJD003).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Shenggui Zhang.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wu, F., Zhang, S. & Li, B. Sub-Ramsey Numbers for Matchings. Graphs and Combinatorics 36, 1675–1685 (2020). https://doi.org/10.1007/s00373-020-02216-2

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-020-02216-2

Keywords

Navigation