Abstract
Given a graph G and a positive integer k, the sub-Ramsey number sr(G, k) 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.
Similar content being viewed by others
References
Albert, M., Frieze, A., Reed, B.: Multicoloured Hamilton cycles. Electron J. Combin. 2, \(\sharp \) R10 (1995)
Alon, N., Caro, Y., Tuza, Z.: Sub-Ramsey numbers for arithmetic progressions. Gr. Combin. 5(4), 307–314 (1989)
Alspach, B., Gerson, M., Hahn, G., Hell, P.: On sub-Ramsey numbers. Ars Combin. 22, 199–206 (1986)
Axenovich, M., Martin, R.: Sub-Ramsey numbers for arithmetic progressions. Gr. Combin. 22(3), 297–309 (2006)
Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. Macmillan London and Elsevier, New York (1976)
Chen, H., Li, X., Tu, J.: Complete solution for the rainbow numbers of matchings. Discret. Math. 309, 3370–3380 (2009)
Cockayne, E.J., Lorimer, P.J.: The Ramsey number for stripes. J. Aust. Math. Soc. 19(2), 5 (1975)
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)
Fraisse, P., Hahn, G., Sotteau, D.: Star sub-Ramsey numbers. Discret. Math. 149(2), 153–163 (1987)
Frieze, A., Reed, B.: Polychromatic Hamilton cycles. Discret. Math. 118(1–3), 69–74 (1993)
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
Galvin, F.: Advanced problem number 6034. Am. Math. Mon. 82, 529 (1975)
Hahn, G.: Anti-Ramsey numbers: an introduction. M.Sc. thesis, Simon Fraser University, Burnaby, BC (1977)
Hahn, G.: More star sub-Ramsey numbers. Discret. Math. 34(2), 131–139 (1981)
Hahn, G., Thomassen, C.: Path and cycle sub-Ramsey numbers and an edge colouring conjecture. Discret. Math. 62(1), 29–33 (1986)
Hell, P., Jose, J., Montellano-Ballesteros, : Polychromatic cliques. Discret. Math. 285(1–3), 319–322 (2004)
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
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
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
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-020-02216-2