{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T18:08:01Z","timestamp":1777745281941,"version":"3.51.4"},"reference-count":116,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2010,1]]},"DOI":"10.1007\/s00373-010-0891-3","type":"journal-article","created":{"date-parts":[[2010,2,24]],"date-time":"2010-02-24T11:30:19Z","timestamp":1267011019000},"page":"1-30","source":"Crossref","is-referenced-by-count":115,"title":["Rainbow Generalizations of Ramsey Theory: A Survey"],"prefix":"10.1007","volume":"26","author":[{"given":"Shinya","family":"Fujita","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Colton","family":"Magnant","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenta","family":"Ozeki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,2,25]]},"reference":[{"issue":"3\u20134","key":"891_CR1","first-page":"203","volume":"17","author":"R. Ahlswede","year":"1992","unstructured":"Ahlswede R., Cai N., Zhang Z.: Rich colorings with local constraints. J. Combin. Inform. Syst. Sci. 17(3\u20134), 203\u2013216 (1992)","journal-title":"J. Combin. Inform. Syst. Sci."},{"key":"891_CR2","unstructured":"Albert, M., Frieze, A., Reed, B.: Comments on: \u201cMulticoloured Hamilton cycles\u201d [Electron. J. Combin. 2 (1995), Research Paper 10, 13\u00a0pp. (electronic); MR1327570 (96b:05058)]. Electron. J. Combin., 2:Research Paper 10, Comment 1, 1 HTML document (electronic) (1995)"},{"issue":"1","key":"891_CR3","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1002\/jgt.3190070112","volume":"7","author":"N. Alon","year":"1983","unstructured":"Alon N.: On a conjecture of Erd\u0151s, Simonovits, and S\u00f3s concerning anti-Ramsey theorems. J. Graph Theory 7(1), 91\u201394 (1983)","journal-title":"J. Graph Theory"},{"issue":"4","key":"891_CR4","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/BF01788685","volume":"5","author":"N. Alon","year":"1989","unstructured":"Alon N., Caro Y., Tuza Z.: Sub-Ramsey numbers for arithmetic progressions. Graphs Combin. 5(4), 307\u2013314 (1989)","journal-title":"Graphs Combin."},{"issue":"4","key":"891_CR5","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1002\/rsa.10102","volume":"23","author":"N. Alon","year":"2003","unstructured":"Alon N., Jiang T., Miller Z., Pritikin D.: Properly colored subgraphs and rainbow subgraphs in edge-colorings with local constraints. Random Struct. Algorithms 23(4), 409\u2013433 (2003)","journal-title":"Random Struct. Algorithms"},{"key":"891_CR6","doi-asserted-by":"crossref","unstructured":"Alon, N., Krech, A., Szab\u00f3, T.: Tur\u00e1n\u2019s theorem in the hypercube. SIAM J. Discret. Math. 21(1):66\u201372 (2007) (electronic)","DOI":"10.1137\/060649422"},{"key":"891_CR7","unstructured":"Alon, N., Lefmann, H., R\u00f6dl, V.: On an anti-Ramsey type result. In: Sets, Graphs and Numbers (Budapest, 1991), Colloq. Math. Soc. J\u00e1nos Bolyai, vol. 60, pp. 9\u201322. North-Holland, Amsterdam (1992)"},{"key":"891_CR8","first-page":"199","volume":"22","author":"B. Alspach","year":"1986","unstructured":"Alspach B., Gerson M., Hahn G., Hell P.: On sub-Ramsey numbers. Ars Combin. 22, 199\u2013206 (1986)","journal-title":"Ars Combin."},{"issue":"1\u20133","key":"891_CR9","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/S0012-365X(00)00052-2","volume":"222","author":"M. Axenovich","year":"2000","unstructured":"Axenovich M.: A generalized Ramsey problem. Discret. Math. 222(1\u20133), 247\u2013249 (2000)","journal-title":"Discret. Math."},{"key":"891_CR10","unstructured":"Axenovich, M., Choi, J.: On colorings avoiding a rainbow cycle and a fixed monochromatic subgraph. Manuscript"},{"key":"891_CR11","doi-asserted-by":"crossref","unstructured":"Axenovich, M., Fon-Der-Flaass, D.: On rainbow arithmetic progressions. Electron. J. Combin. 11(1):Research Paper 1, 7 (2004) (electronic)","DOI":"10.37236\/1754"},{"issue":"1","key":"891_CR12","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1006\/jctb.1999.1948","volume":"79","author":"M. Axenovich","year":"2000","unstructured":"Axenovich M., F\u00fcredi Z., Mubayi D.: On generalized Ramsey theory: the bipartite case. J. Combin. Theory Ser. B 79(1), 66\u201386 (2000)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"2","key":"891_CR13","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/s00373-007-0691-6","volume":"23","author":"M. Axenovich","year":"2007","unstructured":"Axenovich M., Harborth H., Kemnitz A., M\u00f6ller M., Schiermeyer I.: Rainbows in the hypercube. Graphs Combin. 23(2), 123\u2013133 (2007)","journal-title":"Graphs Combin."},{"issue":"20","key":"891_CR14","doi-asserted-by":"crossref","first-page":"4710","DOI":"10.1016\/j.disc.2007.08.092","volume":"308","author":"M. Axenovich","year":"2008","unstructured":"Axenovich M., Iverson P.: Edge-colorings avoiding rainbow and monochromatic subgraphs. Discret. Math. 308(20), 4710\u20134723 (2008)","journal-title":"Discret. Math."},{"issue":"2","key":"891_CR15","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s00373-005-0603-6","volume":"21","author":"M. Axenovich","year":"2005","unstructured":"Axenovich M., Jamison R.E.: Canonical pattern Ramsey numbers. Graphs Combin. 21(2), 145\u2013160 (2005)","journal-title":"Graphs Combin."},{"key":"891_CR16","first-page":"311","volume":"73","author":"M. Axenovich","year":"2004","unstructured":"Axenovich M., Jiang T.: Anti-Ramsey numbers for small complete bipartite graphs. Ars Combin. 73, 311\u2013318 (2004)","journal-title":"Ars Combin."},{"issue":"1","key":"891_CR17","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1002\/jgt.20012","volume":"47","author":"M. Axenovich","year":"2004","unstructured":"Axenovich M., Jiang T., K\u00fcndgen A.: Bipartite anti-Ramsey numbers of cycles. J. Graph Theory 47(1), 9\u201328 (2004)","journal-title":"J. Graph Theory"},{"key":"891_CR18","doi-asserted-by":"crossref","unstructured":"Axenovich, M., Jiang, T., Tuza,Z.: Local anti-Ramsey numbers of graphs. Combin. Probab. Comput. 12(5\u20136):495\u2013511 (2003). Special issue on Ramsey theory","DOI":"10.1017\/S0963548303005868"},{"issue":"3","key":"891_CR19","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/s004930100000","volume":"21","author":"M. Axenovich","year":"2001","unstructured":"Axenovich M., K\u00fcndgen A.: On a generalized anti-Ramsey problem. Combinatorica 21(3), 335\u2013349 (2001)","journal-title":"Combinatorica"},{"issue":"3","key":"891_CR20","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/s00373-006-0663-2","volume":"22","author":"M. Axenovich","year":"2006","unstructured":"Axenovich M., Martin R.: Sub-Ramsey numbers for arithmetic progressions. Graphs Combin. 22(3), 297\u2013309 (2006)","journal-title":"Graphs Combin."},{"issue":"5","key":"891_CR21","doi-asserted-by":"crossref","first-page":"854","DOI":"10.1016\/j.jcta.2006.10.002","volume":"114","author":"\u00c9. Balandraud","year":"2007","unstructured":"Balandraud \u00c9.: Coloured solutions of equations in finite groups. J. Combin. Theory Ser. A 114(5), 854\u2013866 (2007)","journal-title":"J. Combin. Theory Ser. A"},{"issue":"1","key":"891_CR22","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/j.jcta.2005.07.003","volume":"113","author":"P.N. Balister","year":"2006","unstructured":"Balister P.N., Gy\u00e1rf\u00e1s A., Lehel J., Schelp R.H.: Mono-multi bipartite Ramsey numbers, designs, and matrices. J. Combin. Theory Ser. A 113(1), 101\u2013112 (2006)","journal-title":"J. Combin. Theory Ser. A"},{"issue":"4","key":"891_CR23","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/s00493-007-2224-6","volume":"27","author":"R.N. Ball","year":"2007","unstructured":"Ball R.N., Pultr A., Vojt\u011bchovsk\u00fd P.: Colored graphs without colorful cycles. Combinatorica 27(4), 407\u2013427 (2007)","journal-title":"Combinatorica"},{"key":"891_CR24","unstructured":"Bialostocki, A., Dierker, P., Voxman, W.: Either a graph or its complement is connected: a continuing saga. Manuscript"},{"issue":"1-3","key":"891_CR25","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/S0012-365X(00)00157-6","volume":"239","author":"A. Bialostocki","year":"2001","unstructured":"Bialostocki A., Voxman W.: Generalizations of some Ramsey-type theorems for matchings. Discret. Math. 239(1-3), 101\u2013107 (2001)","journal-title":"Discret. Math."},{"key":"891_CR26","first-page":"131","volume":"68","author":"A. Bialostocki","year":"2003","unstructured":"Bialostocki A., Voxman W.: On monochromatic-rainbow generalizations of two Ramsey type theorems. Ars Combin. 68, 131\u2013142 (2003)","journal-title":"Ars Combin."},{"issue":"1","key":"891_CR27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jctb.2000.2016","volume":"82","author":"A. Blokhuis","year":"2001","unstructured":"Blokhuis A., Faudree R., Gy\u00e1rf\u00e1s A., Ruszink\u00f3 M.: Anti-Ramsey colorings in several rounds. J. Combin. Theory Ser. B 82(1), 1\u201318 (2001)","journal-title":"J. Combin. Theory Ser. B"},{"key":"891_CR28","unstructured":"Burr, S.A.: Either a graph or its complement contains a spanning broom. Manuscript"},{"issue":"3","key":"891_CR29","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1002\/jgt.3190130302","volume":"13","author":"S.A. Burr","year":"1989","unstructured":"Burr S.A., Erd\u0151s P., Graham R.L., S\u00f3s V.T.: Maximal anti-Ramsey graphs and the strong chromatic number. J. Graph Theory 13(3), 263\u2013282 (1989)","journal-title":"J. Graph Theory"},{"issue":"1","key":"891_CR30","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1002\/(SICI)1097-0118(199709)26:1<9::AID-JGT2>3.0.CO;2-N","volume":"26","author":"K. Cameron","year":"1997","unstructured":"Cameron K., Edmonds J.: Lambda composition. J. Graph Theory 26(1), 9\u201316 (1997)","journal-title":"J. Graph Theory"},{"issue":"3","key":"891_CR31","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF01848646","volume":"17","author":"K. Cameron","year":"1986","unstructured":"Cameron K., Edmonds J., Lov\u00e1sz L.: A note on perfect graphs. Period. Math. Hung. 17(3), 173\u2013175 (1986)","journal-title":"Period. Math. Hung."},{"key":"891_CR32","volume-title":"Graphs & Digraphs","author":"G. Chartrand","year":"2005","unstructured":"Chartrand, G., Lesniak, L.: Graphs & Digraphs, 4th edn. Chapman & Hall\/CRC, Boca Raton (2005)","edition":"4"},{"key":"891_CR33","volume-title":"Chromatic Graph Theory","author":"G. Chartrand","year":"2009","unstructured":"Chartrand, G., Zhang, P.: Chromatic Graph Theory. Chapman & Hall\/CRC, Boca Raton (2009)"},{"key":"891_CR34","unstructured":"Chen, H., Li, X.: Long heterochromatic paths in heterochromatic triangle free graphs. Manuscript"},{"key":"891_CR35","unstructured":"Chen, H., Li, X., Tu, J.: Complete solution for the rainbow number of matchings. arXiv:math.CO\/0611490"},{"issue":"1","key":"891_CR36","doi-asserted-by":"crossref","first-page":"51","DOI":"10.4007\/annals.2006.164.51","volume":"164","author":"M. Chudnovsky","year":"2006","unstructured":"Chudnovsky M., Robertson N., Seymour P., Thomas R.: The strong perfect graph theorem. Ann. Math. (2) 164(1), 51\u2013229 (2006)","journal-title":"Ann. Math. (2)"},{"issue":"3\u20134","key":"891_CR37","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF02579187","volume":"3","author":"F.R.K. Chung","year":"1983","unstructured":"Chung F.R.K., Graham R.L.: Edge-colored complete graphs with precisely colored subgraphs. Combinatorica 3(3\u20134), 315\u2013324 (1983)","journal-title":"Combinatorica"},{"key":"891_CR38","unstructured":"Erd\u0151s, P.: Solved and unsolved problems in combinatorics and combinatorial number theory. In: Proceedings of the Twelfth Southeastern Conference on Combinatorics, Graph Theory and Computing, Vol. I (Baton Rouge, La., 1981), vol. 32, pp. 49\u201362 (1981)"},{"issue":"1","key":"891_CR39","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/PL00021189","volume":"15","author":"P. Erd\u0151s","year":"1999","unstructured":"Erd\u0151s P., Fowler T.: Finding large p-colored diameter two subgraphs. Graphs Combin. 15(1), 21\u201327 (1999)","journal-title":"Graphs Combin."},{"key":"891_CR40","doi-asserted-by":"crossref","unstructured":"Erd\u0151s, P., Gallai, T.: On maximal paths and circuits of graphs. Acta Math. Acad. Sci. Hung. 10: 337\u2013356 (1959) (unbound insert)","DOI":"10.1007\/BF02024498"},{"issue":"4","key":"891_CR41","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/BF01195000","volume":"17","author":"P. Erd\u0151s","year":"1997","unstructured":"Erd\u0151s P., Gy\u00e1rf\u00e1s A.: A variant of the classical Ramsey problem. Combinatorica 17(4), 459\u2013467 (1997)","journal-title":"Combinatorica"},{"key":"891_CR42","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1112\/jlms\/s1-25.4.249","volume":"25","author":"P. Erd\u0151s","year":"1950","unstructured":"Erd\u0151s P., Rado R.: A combinatorial theorem. J. Lond. Math. Soc. 25, 249\u2013255 (1950)","journal-title":"J. Lond. Math. Soc."},{"key":"891_CR43","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1112\/plms\/s3-2.1.417","volume":"2","author":"P. Erd\u0151s","year":"1952","unstructured":"Erd\u0151s P., Rado R.: Combinatorial theorems on classifications of subsets of a given set. Proc. Lond. Math. Soc. (3) 2, 417\u2013439 (1952)","journal-title":"Proc. Lond. Math. Soc. (3)"},{"key":"891_CR44","first-page":"51","volume":"1","author":"P. Erd\u0151s","year":"1966","unstructured":"Erd\u0151s P., Simonovits M.: A limit theorem in graph theory. Stud. Sci. Math. Hungar 1, 51\u201357 (1966)","journal-title":"Stud. Sci. Math. Hungar"},{"key":"891_CR45","unstructured":"Erd\u0151s, P., Simonovits, M., S\u00f3s, V.T.: Anti-Ramsey theorems. In: Infinite and finite sets (Colloq., Keszthely, 1973; dedicated to P. Erd\u0151s on his 60th birthday), vol. II, pp. 633\u2013643. Colloq. Math. Soc. J\u00e1nos Bolyai, vol. 10. North-Holland, Amsterdam (1975)"},{"key":"891_CR46","unstructured":"Erd\u0151s, P., Spencer, J.: Probabilistic methods in combinatorics, vol. 17. Probability and Mathematical Statistics. Academic Press (A subsidiary of Harcourt Brace Jovanovich, Publishers), New York-London (1974)"},{"key":"891_CR47","first-page":"175","volume":"51","author":"L. Eroh","year":"2004","unstructured":"Eroh L.: Constrained Ramsey numbers of matchings. J. Combin. Math. Combin. Comput. 51, 175\u2013190 (2004)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"891_CR48","first-page":"91","volume":"40","author":"L. Eroh","year":"2004","unstructured":"Eroh L.: Rainbow Ramsey numbers of stars and matchings. Bull. Inst. Combin. Appl. 40, 91\u201399 (2004)","journal-title":"Bull. Inst. Combin. Appl."},{"issue":"1\u20133","key":"891_CR49","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0012-365X(03)00154-7","volume":"277","author":"L. Eroh","year":"2004","unstructured":"Eroh L., Oellermann O.R.: Bipartite rainbow Ramsey numbers. Discret. Math. 277(1\u20133), 57\u201372 (2004)","journal-title":"Discret. Math."},{"key":"891_CR50","unstructured":"Faudree, R.J., Gould,R., Jacobson, M., Magnant, C.: On gallai-Ramsey numbers. Manuscript"},{"key":"891_CR51","doi-asserted-by":"crossref","unstructured":"Fraisse, P., Hahn, G., Sotteau, D.: Star sub-Ramsey numbers. In: Combinatorial Design Theory. North-Holland Math. Stud., vol. 149, pp. 153\u2013163. North-Holland, Amsterdam (1987)","DOI":"10.1016\/S0304-0208(08)72883-4"},{"issue":"1-3","key":"891_CR52","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0012-365X(93)90054-W","volume":"118","author":"A. Frieze","year":"1993","unstructured":"Frieze A., Reed B.: Polychromatic Hamilton cycles. Discret. Math. 118(1-3), 69\u201374 (1993)","journal-title":"Discret. Math."},{"key":"891_CR53","doi-asserted-by":"crossref","unstructured":"Fujita, S., Kaneko, A., Schiermeyer, I., Suzuki, K.: A rainbow k-matching in the complete graph with r colors. Electron. J. Combin. 16(1):Research Paper 51 (2009) (electronic)","DOI":"10.37236\/140"},{"key":"891_CR54","unstructured":"Fujita, S., Magnant, C.: Extensions of rainbow Ramsey results. Manuscript"},{"key":"891_CR55","unstructured":"Fujita, S., Magnant, C.: Gallai-Ramsey numbers for cycles. Manuscript"},{"key":"891_CR56","unstructured":"Fujita, S., Kaneko, A., Saito, A., Schiermeyer, I., Suzuki, K.: Manuscript"},{"issue":"1","key":"891_CR57","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1017\/S0963548300001814","volume":"5","author":"Z. F\u00fcredi","year":"1996","unstructured":"F\u00fcredi Z.: An upper bound on Zarankiewicz\u2019 problem. Combin. Probab. Comput. 5(1), 29\u201333 (1996)","journal-title":"Combin. Probab. Comput."},{"key":"891_CR58","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF02020961","volume":"18","author":"T. Gallai","year":"1967","unstructured":"Gallai T.: Transitiv orientierbare Graphen. Acta Math. Acad. Sci. Hungar 18, 25\u201366 (1967)","journal-title":"Acta Math. Acad. Sci. Hungar"},{"key":"891_CR59","first-page":"529","volume":"82","author":"F. Galvin","year":"1975","unstructured":"Galvin F.: Advanced problem number 6034. Am. Math. Mon. 82, 529 (1975)","journal-title":"Am. Math. Mon."},{"issue":"4","key":"891_CR60","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/s00373-008-0786-8","volume":"24","author":"I. Gorgol","year":"2008","unstructured":"Gorgol I.: Rainbow numbers for cycles with pendant edges. Graphs Combin. 24(4), 327\u2013331 (2008)","journal-title":"Graphs Combin."},{"key":"891_CR61","doi-asserted-by":"crossref","unstructured":"Gorgol, I., \u0141azuka, E.: Rainbow numbers for certain graphs. In: Fifth Cracow Conference on Graph Theory USTRON \u201906. Electron. Notes Discrete Math., vol. 24, pp. 77\u201379. Elsevier, Amsterdam, (2006) (electronic)","DOI":"10.1016\/j.endm.2006.06.013"},{"key":"891_CR62","doi-asserted-by":"crossref","unstructured":"Gy\u00e1rf\u00e1s, A.: Fruit salad. Electron. J. Combin. 4(1):Research Paper 8, 8\u00a0pp. (1997) (electronic)","DOI":"10.37236\/1293"},{"issue":"2","key":"891_CR63","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0095-8956(87)90017-7","volume":"43","author":"A. Gy\u00e1rf\u00e1s","year":"1987","unstructured":"Gy\u00e1rf\u00e1s A., Lehel J., Ne\u0161et\u0159il J., R\u00f6dl V., Schelp R.H., Tuza Zs.: Local k-colorings of graphs and hypergraphs. J. Combin. Theory Ser. B 43(2), 127\u2013139 (1987)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"891_CR64","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/jgt.20179","volume":"54","author":"A. Gy\u00e1rf\u00e1s","year":"2007","unstructured":"Gy\u00e1rf\u00e1s A., Lehel J., Schelp R.H.: Finding a monochromatic subgraph or a rainbow path. J. Graph Theory 54(1), 1\u201312 (2007)","journal-title":"J. Graph Theory"},{"issue":"3","key":"891_CR65","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/BF01788549","volume":"3","author":"A. Gy\u00e1rf\u00e1s","year":"1987","unstructured":"Gy\u00e1rf\u00e1s A., Lehel J., Schelp R.H., Tuza Zs.: Ramsey numbers for local colorings. Graphs Combin. 3(3), 267\u2013277 (1987)","journal-title":"Graphs Combin."},{"key":"891_CR66","unstructured":"Gy\u00e1rf\u00e1s, A., S\u00e1rk\u00f6zy, G., Seb\u0151, A., Selkow, S.: Ramsey-type results for gallai colorings. Manuscript"},{"issue":"3","key":"891_CR67","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1002\/jgt.20001","volume":"46","author":"A. Gy\u00e1rf\u00e1s","year":"2004","unstructured":"Gy\u00e1rf\u00e1s A., Simonyi G.: Edge colorings of complete graphs without tricolored triangles. J. Graph Theory 46(3), 211\u2013216 (2004)","journal-title":"J. Graph Theory"},{"issue":"2","key":"891_CR68","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0012-365X(81)90060-1","volume":"34","author":"G. Hahn","year":"1981","unstructured":"Hahn G.: More star sub-Ramsey numbers. Discret. Math. 34(2), 131\u2013139 (1981)","journal-title":"Discret. Math."},{"issue":"1","key":"891_CR69","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0012-365X(86)90038-5","volume":"62","author":"G. Hahn","year":"1986","unstructured":"Hahn G., Thomassen C.: Path and cycle sub-Ramsey numbers and an edge-colouring conjecture. Discret. Math. 62(1), 29\u201333 (1986)","journal-title":"Discret. Math."},{"key":"891_CR70","unstructured":"Harborth, H., Kemnitz, A., Krause,S.: Manuscript"},{"issue":"4","key":"891_CR71","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1002\/rsa.3240060405","volume":"6","author":"P.E. Haxell","year":"1995","unstructured":"Haxell P.E., Kohayakawa Y.: On an anti-Ramsey property of Ramanujan graphs. Random Struct. Algorithms 6(4), 417\u2013431 (1995)","journal-title":"Random Struct. Algorithms"},{"issue":"1\u20133","key":"891_CR72","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/j.disc.2004.02.013","volume":"285","author":"P. Hell","year":"2004","unstructured":"Hell P., Montellano-Ballesteros J.J.: Polychromatic cliques. Discret. Math. 285(1\u20133), 319\u2013322 (2004)","journal-title":"Discret. Math."},{"issue":"1","key":"891_CR73","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/jgt.10072","volume":"42","author":"R.E. Jamison","year":"2003","unstructured":"Jamison R.E., Jiang T., Ling A.C.H.: Constrained Ramsey numbers of graphs. J. Graph Theory 42(1), 1\u201316 (2003)","journal-title":"J. Graph Theory"},{"issue":"3","key":"891_CR74","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/s00373-004-0562-y","volume":"20","author":"R.E. Jamison","year":"2004","unstructured":"Jamison R.E., West D.B.: On pattern Ramsey numbers of graphs. Graphs Combin. 20(3), 333\u2013339 (2004)","journal-title":"Graphs Combin."},{"issue":"2","key":"891_CR75","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1006\/jctb.2001.2105","volume":"85","author":"T. Jiang","year":"2002","unstructured":"Jiang T.: Anti-Ramsey numbers of subdivided graphs. J. Combin. Theory Ser. B 85(2), 361\u2013366 (2002)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"2","key":"891_CR76","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s003730200022","volume":"18","author":"T. Jiang","year":"2002","unstructured":"Jiang T.: Edge-colorings with no large polychromatic stars. Graphs Combin. 18(2), 303\u2013308 (2002)","journal-title":"Graphs Combin."},{"issue":"1","key":"891_CR77","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s004930070037","volume":"20","author":"T. Jiang","year":"2000","unstructured":"Jiang T., Mubayi D.: New upper bounds for a canonical Ramsey problem. Combinatorica 20(1), 141\u2013146 (2000)","journal-title":"Combinatorica"},{"issue":"3","key":"891_CR78","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1002\/jgt.20380","volume":"61","author":"T. Jiang","year":"2009","unstructured":"Jiang T., Pikhurko O.: Anti-Ramsey numbers of doubly edge-critical graphs. J. Graph Theory 61(3), 210\u2013218 (2009)","journal-title":"J. Graph Theory"},{"key":"891_CR79","unstructured":"Jiang, T., Schiermeyer, I., West, D.B.: The Erd\u0151s-Simonovits-S\u00f3s conjecture for k \u2264\u00a0 7. Manuscript"},{"key":"891_CR80","doi-asserted-by":"crossref","unstructured":"Jiang, T., West, D.B.: Edge-colorings of complete graphs that avoid polychromatic trees. In: The Ninth Quadrennial International Conference on Graph Theory, Combinatorics, Algorithms and Applications. Electron. Notes Discrete Math., pp. 10. Elsevier, Amsterdam (2002) (electronic)","DOI":"10.1016\/S1571-0653(04)00082-4"},{"key":"891_CR81","doi-asserted-by":"crossref","unstructured":"Jiang, T., West, D.B.: On the Erd\u0151s\u2013Simonovits-S\u00f3s conjecture about the anti-Ramsey number of a cycle. Combin. Probab. Comput. 12(5\u20136):585\u2013598 (2003) (Special issue on Ramsey theory)","DOI":"10.1017\/S096354830300590X"},{"key":"891_CR82","doi-asserted-by":"crossref","unstructured":"Jin, Z., Li, X: Anti-Ramsey numbers for graphs with independent cycles. Electron. J. Combin. 16:Research Paper 85 (2009)","DOI":"10.37236\/174"},{"issue":"2","key":"891_CR83","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/s00493-006-0012-3","volume":"26","author":"V. Jungi\u0107","year":"2006","unstructured":"Jungi\u0107 V., Kr\u00e1l D., \u0160krekovski R.: Colorings of plane graphs with no rainbow faces. Combinatorica 26(2), 169\u2013182 (2006)","journal-title":"Combinatorica"},{"key":"891_CR84","unstructured":"Jungi\u0107, V., Licht, J., Mahdian, M., Ne\u0161et\u0159il, J., Radoi\u010di\u0107, R.: Rainbow arithmetic progressions and anti-Ramsey results. Combin. Probab. Comput., 12(5-6):599\u2013620, 2003. Special issue on Ramsey theory"},{"key":"891_CR85","unstructured":"Jungi\u0107, V., Ne\u0161et\u0159il, J., Radoi\u010di\u0107, R.: Rainbow Ramsey theory. Integers 5(2):A9, 13 (electronic), (2005)"},{"key":"891_CR86","unstructured":"Jungi\u0107, V., Radoi\u010di\u0107, R.: Rainbow 3-term arithmetic progressions. Integers 3:A18, 8 (electronic), (2005)"},{"issue":"4","key":"891_CR87","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/s00373-008-0789-5","volume":"24","author":"M. Kano","year":"2008","unstructured":"Kano M., Li X: Monochromatic and heterochromatic subgraphs in edge-colored graphs\u2014a survey. Graphs Combin. 24(4), 237\u2013263 (2008)","journal-title":"Graphs Combin."},{"issue":"1\u20132","key":"891_CR88","first-page":"95","volume":"30","author":"J. K\u00f6rner","year":"1995","unstructured":"K\u00f6rner J., Simonyi G.: Trifference. Stud. Sci. Math. Hung. 30(1\u20132), 95\u2013103 (1995)","journal-title":"Stud. Sci. Math. Hung."},{"issue":"19","key":"891_CR89","doi-asserted-by":"crossref","first-page":"4473","DOI":"10.1016\/j.disc.2007.08.043","volume":"308","author":"A. K\u00fcndgen","year":"2008","unstructured":"K\u00fcndgen A., Pelsmajer M.J.: Nonrepetitive colorings of graphs of bounded tree-width. Discret. Math. 308(19), 4473\u20134478 (2008)","journal-title":"Discret. Math."},{"issue":"1","key":"891_CR90","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jctb.1993.1025","volume":"58","author":"H. Lefmann","year":"1993","unstructured":"Lefmann H., R\u00f6dl V.: On canonical Ramsey numbers for complete graphs versus paths. J. Combin. Theory Ser. B 58(1), 1\u201313 (1993)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"891_CR91","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/BF01294461","volume":"15","author":"H. Lefmann","year":"1995","unstructured":"Lefmann H., R\u00f6dl V.: On Erd\u0151s-Rado numbers. Combinatorica 15(1), 85\u2013104 (1995)","journal-title":"Combinatorica"},{"issue":"2","key":"891_CR92","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1006\/jcta.1996.0049","volume":"74","author":"H. Lefmann","year":"1996","unstructured":"Lefmann H., R\u00f6dl V., Wysocka B.: Multicolored subsets in colored hypergraphs. J. Combin. Theory Ser. A 74(2), 209\u2013248 (1996)","journal-title":"J. Combin. Theory Ser. A"},{"key":"891_CR93","unstructured":"Li, X., Xu, Z.: Rainbow number of matchings in regular bipartite graphs. arXiv:math.CO\/0711.2846"},{"issue":"8","key":"891_CR94","doi-asserted-by":"crossref","first-page":"2575","DOI":"10.1016\/j.disc.2008.05.011","volume":"309","author":"X. Li","year":"2009","unstructured":"Li, X., Tu, J., Jin, Z.: Bipartite rainbow numbers of matchings. Discret. Math. 309(8):2575\u20132578 (2009)","journal-title":"Discret. Math."},{"issue":"3","key":"891_CR95","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0012-365X(72)90006-4","volume":"2","author":"L. Lov\u00e1sz","year":"1972","unstructured":"Lov\u00e1sz L.: Normal hypergraphs and the perfect graph conjecture. Discret. Math. 2(3), 253\u2013267 (1972)","journal-title":"Discret. Math."},{"issue":"4","key":"891_CR96","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF01858468","volume":"12","author":"Y. Manoussakis","year":"1996","unstructured":"Manoussakis Y., Spyratos M., Tuza Zs., Voigt M.: Minimal colorings for properly colored subgraphs. Graphs Combin. 12(4), 345\u2013360 (1996)","journal-title":"Graphs Combin."},{"issue":"1","key":"891_CR97","doi-asserted-by":"crossref","first-page":"19","DOI":"10.7151\/dmgt.1297","volume":"26","author":"J.J. Montellano-Ballesteros","year":"2006","unstructured":"Montellano-Ballesteros J.J.: An anti-Ramsey theorem on edge-cuts. Discuss. Math. Graph Theory 26(1), 19\u201321 (2006)","journal-title":"Discuss. Math. Graph Theory"},{"issue":"3","key":"891_CR98","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1002\/jgt.20140","volume":"51","author":"J.J. Montellano-Ballesteros","year":"2006","unstructured":"Montellano-Ballesteros J.J.: On totally multicolored stars. J. Graph Theory 51(3), 225\u2013243 (2006)","journal-title":"J. Graph Theory"},{"key":"891_CR99","doi-asserted-by":"crossref","unstructured":"Montellano-Ballesteros, J.J., Neumann-Lara,V.: Totally multicoloured cycles. In: 6th International Conference on Graph Theory (Marseille, 2000). Electron. Notes Discrete Math., vol. 5, p 4 (electronic). Elsevier, Amsterdam (2000)","DOI":"10.1016\/S1571-0653(05)80174-X"},{"issue":"3","key":"891_CR100","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/s004930200023","volume":"22","author":"J.J. Montellano-Ballesteros","year":"2002","unstructured":"Montellano-Ballesteros J.J., Neumann-Lara V.: An anti-Ramsey theorem. Combinatorica 22(3), 445\u2013449 (2002)","journal-title":"Combinatorica"},{"issue":"4","key":"891_CR101","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1007\/s00373-003-0511-6","volume":"19","author":"J.J. Montellano-Ballesteros","year":"2003","unstructured":"Montellano-Ballesteros J.J., Neumann-Lara V.: A linear heterochromatic number of graphs. Graphs Combin. 19(4), 533\u2013536 (2003)","journal-title":"Graphs Combin."},{"issue":"3","key":"891_CR102","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/s00373-005-0619-y","volume":"21","author":"J.J. Montellano-Ballesteros","year":"2005","unstructured":"Montellano-Ballesteros J.J., Neumann-Lara V.: An anti-Ramsey theorem on cycles. Graphs Combin. 21(3), 343\u2013354 (2005)","journal-title":"Graphs Combin."},{"issue":"16","key":"891_CR103","doi-asserted-by":"crossref","first-page":"3441","DOI":"10.1016\/j.disc.2007.07.003","volume":"308","author":"J.J. Montellano-Ballesteros","year":"2008","unstructured":"Montellano-Ballesteros J.J., Neumann-Lara V., Rivera-Campo E.: On a heterochromatic number for hypercubes. Discret. Math. 308(16), 3441\u20133448 (2008)","journal-title":"Discret. Math."},{"issue":"2","key":"891_CR104","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/PL00009822","volume":"18","author":"D. Mubayi","year":"1998","unstructured":"Mubayi D.: Edge-coloring cliques with three colors on all 4-cliques. Combinatorica 18(2), 293\u2013296 (1998)","journal-title":"Combinatorica"},{"key":"891_CR105","unstructured":"Mubayi, D., West, D.B.: On restricted edge-colorings of bicliques. Discrete Math. 257(2\u20133):513\u2013529, 2002. Kleitman and combinatorics: a celebration (Cambridge, MA, 1999)"},{"key":"891_CR106","unstructured":"Pula, K.: Gallai multigraphs. Manuscript"},{"key":"891_CR107","unstructured":"Radziszowski, S.P.: Small Ramsey numbers. Electron. J. Combin. 1 Dyn Surv 1, 30 (electronic), (1994)"},{"key":"891_CR108","doi-asserted-by":"crossref","unstructured":"Ramamurthi, R., West, D.B.: Maximum face-constrained coloring of plane graphs. In: The Ninth Quadrennial International Conference on Graph Theory, Combinatorics, Algorithms and Applications. Electron. Notes Discrete Math., vol. 11, p. 8 (electronic). Elsevier, Amsterdam (2002)","DOI":"10.1016\/S1571-0653(04)00100-3"},{"key":"891_CR109","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1112\/plms\/s2-30.1.264","volume":"30","author":"F.P. Ramsey","year":"1930","unstructured":"Ramsey F.P.: On a problem of formal logic. Proc. Lond. Math. Soc. 30, 264\u2013286 (1930)","journal-title":"Proc. Lond. Math. Soc."},{"issue":"2","key":"891_CR110","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF01787730","volume":"6","author":"V. R\u00f6dl","year":"1990","unstructured":"R\u00f6dl V.: On Ramsey families of sets. Graphs Combin. 6(2), 187\u2013195 (1990)","journal-title":"Graphs Combin."},{"issue":"2","key":"891_CR111","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1002\/jgt.20148","volume":"52","author":"G.N. S\u00e1rk\u00f6zy","year":"2006","unstructured":"S\u00e1rk\u00f6zy G.N., Selkow S.: On an anti-Ramsey problem of Burr, Erd\u0151s, Graham, and T S\u00f3s. J. Graph Theory 52(2), 147\u2013156 (2006)","journal-title":"J. Graph Theory"},{"issue":"1\u20132","key":"891_CR112","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/j.disc.2003.11.057","volume":"286","author":"I. Schiermeyer","year":"2004","unstructured":"Schiermeyer I.: Rainbow numbers for matchings and complete graphs. Discret. Math. 286(1\u20132), 157\u2013162 (2004)","journal-title":"Discret. Math."},{"key":"891_CR113","unstructured":"Schiermeyer, I.: Rainbow colourings. 2007. Invited papers from RIMS, Kyoto University"},{"key":"891_CR114","doi-asserted-by":"crossref","unstructured":"Serra,O.: Some Ramsey and anti-Ramsey results in finite groups. In: 6th Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications. Electron. Notes Discrete Math., vol 28, pp 437\u2013444. Elsevier, Amsterdam (2007)","DOI":"10.1016\/j.endm.2007.01.069"},{"issue":"1","key":"891_CR115","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF02579162","volume":"4","author":"M. Simonovits","year":"1984","unstructured":"Simonovits M., S\u00f3s V.T.: On restricted colourings of K n . Combinatorica 4(1), 101\u2013110 (1984)","journal-title":"Combinatorica"},{"key":"891_CR116","first-page":"436","volume":"48","author":"P. Tur\u00e1n","year":"1941","unstructured":"Tur\u00e1n P.: Eine Extremalaufgabe aus der Graphentheorie. Mat. Fiz. Lapok 48, 436\u2013452 (1941)","journal-title":"Mat. Fiz. Lapok"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0891-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-010-0891-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0891-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,24]],"date-time":"2024-03-24T12:35:39Z","timestamp":1711283739000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-010-0891-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1]]},"references-count":116,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,1]]}},"alternative-id":["891"],"URL":"https:\/\/doi.org\/10.1007\/s00373-010-0891-3","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,1]]}}}