T. Noga-alon, Z. Jiang, D. Miller, and . Pritikin, Properly colored subgraphs and rainbow subgraphs in edge-colorings with local constraints. Random Structures Algorithms, pp.409-433, 2003.

H. Noga-alon, V. Lefmann, and . Rödl, On an anti-Ramsey type result In Sets, graphs and numbers (Budapest, 1991), volume 60 of Colloq, Math. Soc. János Bolyai, pp.9-22, 1992.

D. Avis, A survey of heuristics for the weighted matching problem, Networks, vol.8, issue.4, pp.475-493, 1983.
DOI : 10.1002/net.3230130404

M. Axenovich, T. Jiang, and Z. Tuza, Local Anti-Ramsey Numbers of Graphs, Combinatorics, Probability and Computing, vol.12, issue.56, pp.495-511, 2003.
DOI : 10.1017/S0963548303005868

L. Babai, An anti-Ramsey theorem, Graphs and Combinatorics, vol.4, issue.2, pp.23-28, 1985.
DOI : 10.1007/BF02582925

J. Beck, On size Ramsey number of paths, trees, and circuits. I, Journal of Graph Theory, vol.20, issue.1, pp.115-129, 1983.
DOI : 10.1002/jgt.3190070115

J. Beck, Achievement games and the probabilistic method, Combinatorics, Paul Erd? os is eighty, pp.51-78, 1993.

J. Böttcher, Y. Kohayakawa, and A. Procacci, Properly coloured copies and rainbow copies of large graphs with small maximum degree. Random Structures Algorithms, pp.425-436, 2012.

H. Broersma and X. Li, Spanning trees with many or few colors in edge-colored graphs, Discussiones Mathematicae Graph Theory, pp.259-269, 1997.
DOI : 10.7151/dmgt.1053

D. Conlon, On-line Ramsey Numbers, SIAM Journal on Discrete Mathematics, vol.23, issue.4, pp.1954-1963, 2009.
DOI : 10.1137/090749220

S. Das, C. Lee, and B. Sudakov, Rainbow Tur??n problem for even cycles, European Journal of Combinatorics, vol.34, issue.5, pp.905-915, 2013.
DOI : 10.1016/j.ejc.2013.01.003

P. Erd?, O. , and R. J. Faudree, Size Ramsey functions In Sets, graphs and numbers (Budapest, 1991), volume 60 of Colloq, Math. Soc. János Bolyai, pp.219-238, 1992.

P. Erd?-os, R. J. Faudree, C. C. Rousseau, and R. H. Schelp, The size Ramsey number, Periodica Mathematica Hungarica, vol.10, issue.1-2, pp.145-161, 1978.
DOI : 10.1007/BF02018930

P. Erd?-os, M. Simonovits, and V. T. Sós, Anti-Ramsey theorems, Infinite and finite sets, pp.633-643, 1973.

E. Friedgut, Y. Kohayakawa, V. Rödl, A. Rucinski, and P. Tetali, Ramsey Games Against a One-Armed Bandit, Combinatorics, Probability and Computing, vol.12, issue.5, pp.515-546, 2003.
DOI : 10.1017/S0963548303005881

S. Fujita, C. Magnant, and K. Ozeki, Rainbow Generalizations of Ramsey Theory: A Survey, Graphs and Combinatorics, vol.48, issue.1, pp.1-30, 2010.
DOI : 10.1007/s00373-010-0891-3

H. Gebauer and F. Mousset, On rainbow cycles and paths

A. Jaross, M. Grytczuk, H. A. Haa, and . Kierstead, On-line Ramsey theory, Electron. J. Combin, vol.11, issue.10, 2004.

A. Jaross, . Grytczuk, and A. Henry, Kierstead, and Pawee l Praa lat. On-line Ramsey numbers for paths and stars, Discrete Math. Theor. Comput. Sci, vol.10, issue.3, pp.63-74, 2008.

A. Gyárfás, M. Ruszinkó, G. N. Sárközy, and R. H. Schelp, Long rainbow cycles in proper edge-colorings of complete graphs, Australas. J. Combin, vol.50, pp.45-53, 2011.

P. Keevash, D. Mubayi, B. Sudakov, and J. Verstraëte, Rainbow Tur??n Problems, Combinatorics, Probability and Computing, vol.16, issue.01, pp.109-126, 2007.
DOI : 10.1017/S0963548306007760

A. Hal, G. Kierstead, and . Konjevod, Coloring number and on-line Ramsey theory for graphs and hypergraphs, Combinatorica, vol.29, issue.1, pp.49-64, 2009.

A. Kostochka and M. Yancey, Large Rainbow Matchings in Edge-Coloured Graphs, Combinatorics, Probability and Computing, vol.17, issue.1-2, pp.255-263, 2012.
DOI : 10.1007/s00373-008-0789-5

A. Kurek and A. Ruci´nskiruci´nski, Two variants of the size Ramsey number, Discussiones Mathematicae Graph Theory, vol.25, issue.1-2, pp.141-149, 2005.
DOI : 10.7151/dmgt.1268

X. Li and Z. Xu, On the existence of a rainbow 1-factor in proper coloring of K (r) rn, 2007.

M. Maamoun and H. Meyniel, On a problem of G. Hahn about coloured hamiltonian paths in K2t, Discrete Mathematics, vol.51, issue.2, pp.213-214, 1984.
DOI : 10.1016/0012-365X(84)90073-6

P. and P. Lat, A note on small on-line Ramsey numbers for paths and their generalization, Australas. J. Combin, vol.40, pp.27-36, 2008.

V. Rödl and Z. Tuza, Rainbow subgraphs in properly edge-colored graphs. Random Structures Algorithms, pp.175-182, 1992.

J. Herbert and . Ryser, Neuere Probleme der Kombinatorik, Mathematisches Forschungsinstitut Oberwolfach, pp.24-29, 1967.

C. Thomassen, Decomposing graphs into paths of fixed length, Combinatorica, vol.36, issue.1, pp.97-123, 2013.
DOI : 10.1007/s00493-013-2633-7

D. B. West, Introduction to graph theory, 2001.

K. Institut-für-technologie, . Karlsruhe, and E. Germany, E-mail address: kolja.knauer@math.univ-montp2.fr Karlsruher Institut für Technologie, edu Université Montpellier 2