Abstract
The anti-Ramsey number AR(G, H) is defined to be the maximum number of colors in an edge coloring of G which doesn’t contain any rainbow subgraphs isomorphic to H. It is clear that there is an \(AR(K_{m,n},kK_2)\)-edge-coloring of \(K_{m,n}\) that doesn’t contain any rainbow \(kK_2\). In this paper, we show the uniqueness of this kind of \(AR(K_{m,n},kK_2)\)-edge-coloring of \(K_{m,n}\).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alon N (1983) On a conjecture of Erdős, Simonovits and Sós concerning anti-Ramsey theorems. J Graph Theory 1:91–94
Axenovich M, Jiang T (2004) Anti-Ramsey numbers for small complete bipartite graphs. Ars Comb 73:311–318
Axenovich M, Jiang T, Kündgen A (2004) Bipartite anti-Ramsey numbers of cycles. J Graph Theory 47:9–28
Chen H, Li XL, Tu JH (2009) Complete solution for the rainbow numbers of matchings. Discret Math 309:3370–3380
Erdős P, Simonovits M, Sós VT (1973) Anti-Ramsey theorems. In: Infinite and finite sets, vol. 10. Colloq. Math. Soc. Janos Bolyai., Keszthely, pp 657–665
Fujita S, Magnant C, Ozeki K (2010) Rainbow generalizations of Ramsey theory: a survey. Graphs Comb 26:1–30
Jiang T (2002) Edge-colorings with no large polychromatic stars. Graphs Comb 18:303–308
Jiang T (2002) Anti-Ramsey numbers of subdivided graphs. J Comb Theory Ser B 85:361–366
Jiang T, West DB (2003) On the Erdős–Simonovits–Sós conjecture on the anti-Ramsey number of a cycle. Comb Probab Comput 12:585–598
Jiang T, West DB (2004) Edge-colorings of complete graphs that avoid polychromatic trees. Discret Math 274:137–145
Jin ZM, Li LF (2013) Edge-colorings of complete bipartite graphs without large rainbow trees. Ars Comb 111:75–84
Jin ZM (2009) Anti-Ramsey numbers for graphs with independent cycles. Electron J Combin 16:#R85
Kano M, Li XL (2008) Monochromatic and heterochromatic subgraphs in edge-colored graphs—a survey. Graphs Comb 24:237–263
Li XL, Tu JH, Jin ZM (2009) Bipartite rainbow numbers of matchings. Discret Math 309:2575–2578
Li XL, Xu ZX (2009) The rainbow number of matchings in regular bipartite graphs. Appl Math Lett 22:1525–1528
Lovász L, Plummer MD (1986) Matching theory. Ann Discret Math 29:17–18
Montellano-Ballesteros JJ, Neumann-Lara V (2002) An anti-Ramsey theorem. Combinatorica 22:445–449
Montellano-Ballesteros JJ, Neumann-Lara V (2005) An anti-Ramsey theorem on cycles. Graphs Comb 21:343–354
Schiermeyer I (2004) Rainbow numbers for matchings and complete graphs. Discret Math 286:157–162
Simonovits M, Sós VT (1984) On restricting colorings of \(K_n\). Combinatorica 4:101–110
Acknowledgments
This work was supported by Zhejiang Provincial Natural Science Foundation (LY14A010009 and LY15A010008). The authors are very grateful to the referees for helpful comments and suggestions.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Jin, Z., Zang, Y. Anti-Ramsey coloring for matchings in complete bipartite graphs. J Comb Optim 33, 1–12 (2017). https://doi.org/10.1007/s10878-015-9926-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-015-9926-2