{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,8]],"date-time":"2023-10-08T16:09:24Z","timestamp":1696781364664},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,6,1]],"date-time":"2008-06-01T00:00:00Z","timestamp":1212278400000},"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":[[2008,6]]},"DOI":"10.1007\/s00373-008-0784-x","type":"journal-article","created":{"date-parts":[[2008,6,11]],"date-time":"2008-06-11T04:40:22Z","timestamp":1213159222000},"page":"205-228","source":"Crossref","is-referenced-by-count":13,"title":["On the Ramsey Number of Sparse 3-Graphs"],"prefix":"10.1007","volume":"24","author":[{"given":"Brendan","family":"Nagle","sequence":"first","affiliation":[]},{"given":"Sayaka","family":"Olsen","sequence":"additional","affiliation":[]},{"given":"Vojt\u011bch","family":"R\u00f6dl","sequence":"additional","affiliation":[]},{"given":"Mathias","family":"Schacht","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,6,12]]},"reference":[{"key":"784_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N.: Subdivided graphs have linear Ramsey numbers, J. Graph Theory 18(4), 343\u2013347 (1994)","DOI":"10.1002\/jgt.3190180406"},{"key":"784_CR2","unstructured":"Burr, S.A., Erd\u0151s, P.: On the magnitude of generalized Ramsey numbers for graphs, Infinite and finite sets (Colloq., Keszthely, 1973; dedicated to P. Erd\u0151s on his 60th birthday), Vol. 1, North-Holland, Amsterdam, 1975, pp. 215\u2013240. Colloq. Math. Soc. J\u00e1nos Bolyai, Vol. 10 (1975)"},{"key":"784_CR3","unstructured":"Chen, G., Schelp, R.H.: Graphs with linearly bounded Ramsey numbers, J. Combin. Theory Ser. B 57(1), 138\u2013149 (1993)"},{"key":"784_CR4","unstructured":"Chv\u00e1tal, V., R\u00f6dl, V., Szemer\u00e9di, E., Trotter, W.T. Jr.: The Ramsey number of a graph with bounded maximum degree, J. Combin. Theory Ser. B 34(3), 239\u2013243 (1983)"},{"key":"784_CR5","unstructured":"Cooley, O., Fountoulakis, N., K\u00fchn, D., Osthus, D.: 3-uniform hypergraphs of bounded degree have linear Ramsey numbers, J. Combin. Theory Ser. B, to appear"},{"key":"784_CR6","doi-asserted-by":"crossref","unstructured":"Frankl, P., R\u00f6dl, V.: Extremal problems on set systems, Random Structures Algorithms 20(2), 131\u2013164 (2002)","DOI":"10.1002\/rsa.10017"},{"key":"784_CR7","unstructured":"Graham, R.L., Rothschild, B.L., Spencer, J.H.: Ramsey theory, second ed., Wiley-Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons Inc., New York, 1990, A Wiley-Interscience Publication."},{"key":"784_CR8","unstructured":"Haxell, P.E., \u0141uczak, T., Peng, Y., R\u00f6dl, V., Ruci\u0144ski, A., Simonovits, M., Skokan, J.: The Ramsey number of hypergraph cycles. I, J. Combin. Theory Ser. A 113(1), 67\u201383 (2006)"},{"key":"784_CR9","unstructured":"Koml\u00f3s, J., Simonovits, M.: Szemer\u00e9di\u2019s regularity lemma and its applications in graph theory, Combinatorics, Paul Erd\u0151s is eighty, Vol. 2 (Keszthely, 1993), Bolyai Soc. Math. Stud., vol. 2, J\u00e1nos Bolyai Math. Soc., Budapest, 1996, pp. 295\u2013352"},{"key":"784_CR10","doi-asserted-by":"crossref","unstructured":"Kostochka, A.V., R\u00f6dl, V.: On graphs with small Ramsey numbers, J. Graph Theory 37(4), 198\u2013204 (2001)","DOI":"10.1002\/jgt.1014"},{"key":"784_CR11","doi-asserted-by":"crossref","unstructured":"Kostochka, A.V., R\u00f6dl, V.: On graphs with small Ramsey numbers. II, Combinatorica 24(3), 389\u2013401 (2004)","DOI":"10.1007\/s00493-004-0024-9"},{"key":"784_CR12","unstructured":"Kostochka, A.V., R\u00f6dl, V.: On Ramsey numbers of uniform hypergraphs with given maximum degree, J. Combin. Theory Ser. A 113(7), 1555\u20131564 (2006)"},{"key":"784_CR13","doi-asserted-by":"crossref","unstructured":"Kostochka, A.V., Sudakov, B.: On Ramsey numbers of sparse graphs, Combin. Probab. Comput. 12 (2003), no. 5-6, 627\u2013641, Special issue on Ramsey theory","DOI":"10.1017\/S0963548303005728"},{"key":"784_CR14","doi-asserted-by":"crossref","unstructured":"Nagle, B., R\u00f6dl, V.: The asymptotic number of triple systems not containing a fixed one, Discrete Math. 235(1-3), 271\u2013290, Combinatorics (Prague, 1998)","DOI":"10.1016\/S0012-365X(00)00280-6"},{"key":"784_CR15","doi-asserted-by":"crossref","unstructured":"Nagle, B., R\u00f6dl, V., Schacht, M.: The counting lemma for regular k-uniform hypergraphs, Random Structures Algorithms 28(2), 113\u2013179 (2006)","DOI":"10.1002\/rsa.20117"},{"key":"784_CR16","unstructured":"Olsen, S.: On the Ramsey number of sparse 3-graphs, Master\u2019s thesis, University of Nevada, Reno, Department of Mathematics and Statistics, May 2008, expected."},{"key":"784_CR17","unstructured":"R\u00f6dl, V., Schacht, M.: Regular partitions of hypergraphs: Regularity Lemmas, Combin. Probab. Comput. 16(6), 833\u2013885 (2007)"},{"key":"784_CR18","doi-asserted-by":"crossref","unstructured":"R\u00f6dl, V., Thomas, R.: Arrangeability and clique subdivisions, The mathematics of Paul Erd\u0151s, II, Algorithms Combin., vol. 14, Springer, Berlin, 1997, pp. 236\u2013239","DOI":"10.1007\/978-3-642-60406-5_20"},{"key":"784_CR19","unstructured":"Tao, T.: A variant of the hypergraph removal lemma, J. Combin. Theory Ser. A 113(7), 1257\u20131280 (2006)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-008-0784-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-008-0784-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-008-0784-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:28Z","timestamp":1559055508000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-008-0784-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,6]]}},"alternative-id":["784"],"URL":"https:\/\/doi.org\/10.1007\/s00373-008-0784-x","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,6]]}}}