{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:43Z","timestamp":1740107143692,"version":"3.37.3"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,3,15]],"date-time":"2018-03-15T00:00:00Z","timestamp":1521072000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11671124"],"award-info":[{"award-number":["11671124"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1007\/s00373-018-1888-6","type":"journal-article","created":{"date-parts":[[2018,3,15]],"date-time":"2018-03-15T06:47:16Z","timestamp":1521096436000},"page":"489-499","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Note on Non-jumping Numbers for r-Uniform Hypergraphs"],"prefix":"10.1007","volume":"34","author":[{"given":"Shaoqiang","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuejian","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,15]]},"reference":[{"issue":"2","key":"1888_CR1","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1017\/S0963548310000222","volume":"20","author":"R Baber","year":"2011","unstructured":"Baber, R., Talbot, J.: Hypergraphs do jump. Combin. Probab. Comput. 20(2), 161\u2013171 (2011)","journal-title":"Combin. Probab. Comput."},{"key":"1888_CR2","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/BF02759942","volume":"2","author":"P Erd\u0151s","year":"1964","unstructured":"Erd\u0151s, P.: On extremal problems of graphs and generalized graphs. Isr. J. Math. 2, 183\u2013190 (1964)","journal-title":"Isr. J. Math."},{"key":"1888_CR3","first-page":"51","volume":"1","author":"P Erd\u0151s","year":"1966","unstructured":"Erd\u0151s, P., Simonovits, M.: A limit theorem in graph theory. Studia Sci. Mat. Hungar. Acad. 1, 51\u201357 (1966)","journal-title":"Studia Sci. Mat. Hungar. Acad."},{"key":"1888_CR4","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1090\/S0002-9904-1946-08715-7","volume":"52","author":"P Erd\u0151s","year":"1946","unstructured":"Erd\u0151s, P., Stone, A.H.: On the structure of linear graphs. Bull. Am. Math. Soc. 52, 1087\u20131091 (1946)","journal-title":"Bull. Am. Math. Soc."},{"key":"1888_CR5","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/j.jctb.2006.05.004","volume":"97","author":"P Frankl","year":"2007","unstructured":"Frankl, P., Peng, Y., R\u00f6dl, V., Talbot, J.: A note on the jumping constant conjecture of Erd\u00f6s. J. Combin. Theory Ser. B. 97, 204\u2013216 (2007)","journal-title":"J. Combin. Theory Ser. B."},{"key":"1888_CR6","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/BF02579215","volume":"4","author":"P Frankl","year":"1984","unstructured":"Frankl, P., R\u00f6dl, V.: Hypergraphs do not jump. Combinatorica 4, 149\u2013159 (1984)","journal-title":"Combinatorica"},{"key":"1888_CR7","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1016\/j.amc.2017.08.014","volume":"317","author":"R Gu","year":"2018","unstructured":"Gu, R., Li, X., Qin, Z., Shi, Y., Yang, K.: Non-jumping numbers for 5-uniform hypergraphs. Appl. Math. Comput. 317, 234\u2013251 (2018)","journal-title":"Appl. Math. Comput."},{"issue":"1","key":"1888_CR8","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s00373-006-0689-5","volume":"23","author":"Y Peng","year":"2007","unstructured":"Peng, Y.: Non-jumping numbers for 4-uniform hypergraphs. Graphs Combin. 23(1), 97\u2013110 (2007)","journal-title":"Graphs Combin."},{"key":"1888_CR9","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s00026-008-0353-2","volume":"12","author":"Y Peng","year":"2008","unstructured":"Peng, Y.: Using lagrangians of hypergraphs to find non-jumping numbers I. Ann. Combin. 12, 307\u2013324 (2008)","journal-title":"Ann. Combin."},{"key":"1888_CR10","doi-asserted-by":"publisher","first-page":"1754","DOI":"10.1016\/j.disc.2006.09.024","volume":"307","author":"Y Peng","year":"2007","unstructured":"Peng, Y.: Using Lagrangians of hypergraphs to find non-jumping numbers (II). Discrete Math. 307, 1754\u20131766 (2007)","journal-title":"Discrete Math."},{"issue":"4","key":"1888_CR11","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/s00373-009-0859-3","volume":"25","author":"Y Peng","year":"2009","unstructured":"Peng, Y.: On substructure densities of hypergraphs. Graphs Combin. 25(4), 583\u2013600 (2009)","journal-title":"Graphs Combin."},{"key":"1888_CR12","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1007\/s00373-010-0874-4","volume":"25","author":"Y Peng","year":"2009","unstructured":"Peng, Y.: On jumping densities of hypergraphs. Graphs Combin. 25, 759\u2013766 (2009)","journal-title":"Graphs Combin."},{"key":"1888_CR13","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/s11856-014-0031-5","volume":"201","author":"O Pikhurko","year":"2014","unstructured":"Pikhurko, O.: On possible tur\u00e1n densities. Isr. J. Math. 201, 415\u2013454 (2014)","journal-title":"Isr. J. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-018-1888-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1888-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1888-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,29]],"date-time":"2020-10-29T09:00:56Z","timestamp":1603962056000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-018-1888-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,15]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,5]]}},"alternative-id":["1888"],"URL":"https:\/\/doi.org\/10.1007\/s00373-018-1888-6","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2018,3,15]]},"assertion":[{"value":"21 January 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 February 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 March 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}