{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T12:53:38Z","timestamp":1772369618419,"version":"3.50.1"},"reference-count":31,"publisher":"EDP Sciences","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[2005,1]]},"DOI":"10.1051\/ita:2005019","type":"journal-article","created":{"date-parts":[[2005,2,22]],"date-time":"2005-02-22T10:43:04Z","timestamp":1109068984000},"page":"191-206","source":"Crossref","is-referenced-by-count":7,"title":["A note on the Size-Ramsey number of long subdivisions of graphs"],"prefix":"10.1051","volume":"39","author":[{"given":"Jair","family":"Donadelli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Penny E.","family":"Haxell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshiharu","family":"Kohayakawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2005,3,15]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0012-365X(88)90189-6","volume":"72","author":"Alon","year":"1988","journal-title":"Discrete Math."},{"key":"R2","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1002\/jgt.3190180406","volume":"18","author":"Alon","year":"1994","journal-title":"J. Graph Theory"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"N. Alon and J.H. Spencer,The probabilistic method, 2nd edition,Ser. Discrete Math.Optim., Wiley-Interscience, John Wiley & Sons, New York, 2000. (With an appendix on the life and work of Paul Erd\u0151s.)","DOI":"10.1002\/0471722154"},{"key":"R4","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1002\/jgt.3190070115","volume":"7","author":"Beck","year":"1983","journal-title":"J. Graph Theory"},{"key":"R5","unstructured":"J. Beck,On size Ramsey number of paths, trees and circuits. II. Mathematics of Ramsey theory, Springer, Berlin,Algorithms Combin.5(1990) 34\u201345."},{"key":"R6","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0095-8956(83)90037-0","volume":"34","author":"Chv\u00e1tal","year":"1983","journal-title":"J. Combin. Theory Ser. B"},{"key":"R7","unstructured":"R. Diestel,Graph theory. Springer-Verlag, New York (1997). Translated from the 1996 German original."},{"key":"R8","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF02018930","volume":"9","author":"Erd\u0151s","year":"1978","journal-title":"Periodica Mathematica Hungarica"},{"key":"R9","unstructured":"P. Erd\u0151s and R.L. Graham,On partition theorems for finite graphs, Infinite and finite sets (Colloq., Keszthely, 1973; dedicated to P. Erd\u0151s on his 60th birthday), Vol. I. North-Holland, Amsterdam,Colloq. Math. Soc. J\u00e1nos Bolyai10(1975) 515\u2013527."},{"key":"R10","unstructured":"R.J. Faudree and R.H. Schelp,A survey of results on the size Ramsey number, Paul Erd\u0151s and his mathematics, II (Budapest, 1999). Bolyai Soc. Math. Stud., J\u00e1nos Bolyai Math. Soc., Budapest11(2002) 291\u2013309."},{"key":"R11","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF02579202","volume":"7","author":"Friedman","year":"1987","journal-title":"Combinatorica"},{"key":"R12","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1006\/jctb.1997.1737","volume":"69","author":"Haxell","year":"1997","journal-title":"J. Combin. Theory Ser. B"},{"key":"R13","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF02808204","volume":"89","author":"Haxell","year":"1995","journal-title":"Israel J. Math."},{"key":"R14","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1017\/S0963548300001619","volume":"4","author":"Haxell","year":"1995","journal-title":"Combin. Probab. Comput."},{"key":"R15","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/S0012-365X(99)00354-4","volume":"216","author":"Haxell","year":"2000","journal-title":"Discrete Math."},{"key":"R16","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/s004930200014","volume":"22","author":"Haxell","year":"2002","journal-title":"Combinatorica"},{"key":"R17","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1006\/jctb.2001.2049","volume":"83","author":"Jiang","year":"2001","journal-title":"J. Combin. Theory Ser. B"},{"key":"R18","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1002\/rsa.3240040106","volume":"4","author":"Xin","year":"1993","journal-title":"Random Structures Algorithms"},{"key":"R19","doi-asserted-by":"crossref","unstructured":"Y. Kohayakawa,Szemer\u00e9di's regularity lemma for sparse graphs, Foundations of computational mathematics (Rio de Janeiro, 1997). Springer, Berlin (1997) 216\u2013230.","DOI":"10.1007\/978-3-642-60539-0_16"},{"key":"R20","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1002\/rsa.10081","volume":"22","author":"Kohayakawa","year":"2003","journal-title":"Random Structures Algorithms"},{"key":"R21","doi-asserted-by":"crossref","unstructured":"Y. Kohayakawa and V. R\u00f6dl,Szemer\u00e9di's regularity lemma and quasi-randomness, in Recent advances in algorithms and combinatorics. CMS Books Math.\/Ouvrages Math. SMC, Springer, New York11(2003) 289\u2013351.","DOI":"10.1007\/0-387-22444-0_9"},{"key":"R22","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF02126799","volume":"8","author":"Lubotzky","year":"1988","journal-title":"Combinatorica"},{"key":"R23","first-page":"51","volume":"24","author":"Margulis","year":"1988","journal-title":"Problemy Peredachi Informatsii"},{"key":"R24","unstructured":"I. Pak,Mixing time and long paths in graphs, manuscript available at http:\/\/www-math.mit.edu\/~pak\/research.html#r (June 2001)."},{"key":"R25","unstructured":"I. Pak, Mixing time and long paths in graphs, inProceedings of the 13th annual ACM-SIAM Symposium on Discrete Algorithms(SODA 2002) 321\u2013328."},{"key":"R26","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1137\/S0895480101384086","volume":"16","author":"Pikhurko","year":"2002","journal-title":"SIAM J. Discrete Math."},{"key":"R27","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1002\/jgt.10086","volume":"42","author":"Pikhurko","year":"2003","journal-title":"J. Graph Theory"},{"key":"R28","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0012-365X(76)90068-6","volume":"14","author":"P\u00f3sa","year":"1976","journal-title":"Discrete Math."},{"key":"R29","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/S0012-365X(02)00396-5","volume":"257","author":"Reimer","year":"2002","journal-title":"Discrete Math."},{"key":"R30","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/s004930070024","volume":"20","author":"R\u00f6dl","year":"2000","journal-title":"Combinatorica"},{"key":"R31","unstructured":"E. Szemer\u00e9di, Regular partitions of graphs, inProbl\u00e8mes combinatoires et th\u00e9orie des graphes(Colloq. Internat. CNRS, Univ. Orsay, Orsay, 1976). CNRS, Paris (1978) 399\u2013401."}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita:2005019\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T21:43:02Z","timestamp":1586122982000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita:2005019"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,1]]},"references-count":31,"journal-issue":{"issue":"1"},"alternative-id":["ita0424"],"URL":"https:\/\/doi.org\/10.1051\/ita:2005019","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,1]]}}}