{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,12]],"date-time":"2024-02-12T23:26:43Z","timestamp":1707780403372},"reference-count":15,"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-0908-y","type":"journal-article","created":{"date-parts":[[2010,2,16]],"date-time":"2010-02-16T00:43:12Z","timestamp":1266280992000},"page":"71-76","source":"Crossref","is-referenced-by-count":7,"title":["Long Monochromatic Berge Cycles in Colored 4-Uniform Hypergraphs"],"prefix":"10.1007","volume":"26","author":[{"given":"Andr\u00e1s","family":"Gy\u00e1rf\u00e1s","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00e1bor N.","family":"S\u00e1rk\u00f6zy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Endre","family":"Szemer\u00e9di","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,2,17]]},"reference":[{"key":"908_CR1","volume-title":"Graphs and Hypergraphs","author":"C. Berge","year":"1973","unstructured":"Berge C.: Graphs and Hypergraphs. North Holland, Amsterdam (1973)"},{"key":"908_CR2","doi-asserted-by":"crossref","first-page":"1722","DOI":"10.1016\/j.disc.2006.01.030","volume":"308","author":"B. Bollob\u00e1s","year":"2008","unstructured":"Bollob\u00e1s B., Gy\u00e1rf\u00e1s A.: Highly connected monochromatic subgraphs. Discrete Math. 308, 1722\u20131725 (2008)","journal-title":"Discrete Math."},{"key":"908_CR3","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1002\/jgt.20329","volume":"59","author":"P. Dorbec","year":"2008","unstructured":"Dorbec P., Gravier S., S\u00e1rk\u00f6zy G.N.: Monochromatic Hamiltonian t-tight Berge-cycles in hypergraphs. J. Graph Theory 59, 34\u201344 (2008)","journal-title":"J. Graph Theory"},{"key":"908_CR4","first-page":"313","volume":"8","author":"R.J. Faudree","year":"1974","unstructured":"Faudree R.J., Schelp R.H.: All Ramsey numbers for cycles in graphs. Discrete Appl. Math. 8, 313\u2013329 (1974)","journal-title":"Discrete Appl. Math."},{"key":"908_CR5","doi-asserted-by":"crossref","first-page":"584","DOI":"10.1016\/j.jctb.2006.09.001","volume":"97","author":"A. Figaj","year":"2007","unstructured":"Figaj A., \u0141uczak T.: The Ramsey number for a triple of long even cycles. J. Comb. Theory Ser. B 97, 584\u2013596 (2007)","journal-title":"J. Comb. Theory Ser. B"},{"key":"908_CR6","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/s00493-007-0043-4","volume":"27","author":"A. Gy\u00e1rf\u00e1s","year":"2007","unstructured":"Gy\u00e1rf\u00e1s A., Ruszink\u00f3 M., S\u00e1rk\u00f6zy G.N., Szemer\u00e9di E.: Three-color Ramsey numbers for paths. Combinatorica 27, 35\u201369 (2007)","journal-title":"Combinatorica"},{"key":"908_CR7","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1016\/j.jctb.2007.07.002","volume":"98","author":"A. Gy\u00e1rf\u00e1s","year":"2008","unstructured":"Gy\u00e1rf\u00e1s A., Lehel J., S\u00e1rk\u00f6zy G.N., Schelp R.H.: Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs. J. Comb. Theory Ser. B 98, 342\u2013358 (2008)","journal-title":"J. Comb. Theory Ser. B"},{"key":"908_CR8","unstructured":"Gy\u00e1rf\u00e1s, A., S\u00e1rk\u00f6zy, G.N.: The 3-color Ramsey number of a 3-uniform Berge-cycle. Comb. Probab. Comput. (accepted)"},{"key":"908_CR9","doi-asserted-by":"crossref","unstructured":"Gy\u00e1rf\u00e1s, A., S\u00e1rk\u00f6zy, G.N., Szemer\u00e9di, E.: Monochromatic matchings in the shadow graph of almost complete hypergraphs. Ann. Combin. (accepted)","DOI":"10.1007\/s00026-010-0058-1"},{"key":"908_CR10","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.jcta.2005.02.005","volume":"113","author":"P. Haxell","year":"2006","unstructured":"Haxell P., \u0141uczak T., Peng Y., R\u00f6dl V., Rucin\u0302ski A., Simonovits M., Skokan J.: The Ramsey number for hypergraph cycles I. J. Comb. Theory Ser. A 113, 67\u201383 (2006)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"1\u20132","key":"908_CR11","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1017\/S096354830800967X","volume":"18","author":"P. Haxell","year":"2009","unstructured":"Haxell P., \u0141uczak T., Peng Y., R\u00f6dl V., Rucin\u0302ski A., Skokan J.: The Ramsey Number for 3-uniform tight hypergraph cycles. Combin. Probab. Comput. 18(1\u20132), 165\u2013203 (2009)","journal-title":"Combin. Probab. Comput."},{"key":"908_CR12","volume-title":"Combinatorial Problems and Exercises","author":"L. Lov\u00e1sz","year":"1979","unstructured":"Lov\u00e1sz L.: Combinatorial Problems and Exercises. Akad\u00e9miai Kiad\u00f3, North-Holland (1979)","edition":"2"},{"key":"908_CR13","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1006\/jctb.1998.1874","volume":"75","author":"T. \u0141uczak","year":"1999","unstructured":"\u0141uczak T.: R(C n , C n , C n ) \u2264 (4\u00a0+\u00a0o(1))n. J. Comb. Theory Ser. B 75, 174\u2013187 (1999)","journal-title":"J. Comb. Theory Ser. B"},{"key":"908_CR14","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1017\/S0963548305007042","volume":"15","author":"V. R\u00f6dl","year":"2006","unstructured":"R\u00f6dl V., Rucinski A., Szemer\u00e9di E.: A Dirac-type theorem for 3-uniform hypergraphs. Comb. Probab. Comput. 15, 229\u2013251 (2006)","journal-title":"Comb. Probab. Comput."},{"key":"908_CR15","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/0095-8956(73)90035-X","volume":"15","author":"V. Rosta","year":"1973","unstructured":"Rosta V.: On a Ramsey type problem of Bondy and Erd\u0151s, I and II. J. Comb. Theory B 15, 94\u2013120 (1973)","journal-title":"J. Comb. Theory B"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0908-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-010-0908-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0908-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:58:30Z","timestamp":1559041110000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-010-0908-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,1]]}},"alternative-id":["908"],"URL":"https:\/\/doi.org\/10.1007\/s00373-010-0908-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,1]]}}}