{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T23:37:04Z","timestamp":1780443424735,"version":"3.54.1"},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,2,1]],"date-time":"2007-02-01T00:00:00Z","timestamp":1170288000000},"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":[[2007,2]]},"DOI":"10.1007\/s00373-006-0689-5","type":"journal-article","created":{"date-parts":[[2007,2,22]],"date-time":"2007-02-22T12:15:01Z","timestamp":1172146501000},"page":"97-110","source":"Crossref","is-referenced-by-count":10,"title":["Non-Jumping Numbers for 4-Uniform Hypergraphs"],"prefix":"10.1007","volume":"23","author":[{"given":"Yuejian","family":"Peng","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"689_CR1","unstructured":"Erd\u0151s, P.: On extremal problems of graphs and generalized graphs, Israel J. Math. 2, 183\u2013190 (1964)"},{"key":"689_CR2","unstructured":"Erd\u0151s, P., Simonovits, M.: A limit theorem in graph theory, Studia Sci. Mat. Hung. Acad. 1, 51\u201357 (1966)"},{"key":"689_CR3","unstructured":"Erd\u0151s, P., Stone, A.H.: On the structure of linear graphs, Bull. Amer. Math. Soc. 52, 1087\u20131091 (1946)"},{"key":"689_CR4","unstructured":"Frankl, P., R\u00f6dl, V.: Hypergraphs do not jump, Combinatorica 4, 149\u2013159 (1984)"},{"key":"689_CR5","unstructured":"Frankl, P., Peng, Y., R\u00f6dl, V., Talbot, J.: A note on the jumping constant conjecture of Erd\u0151s, J. Combin. Th. Series B 97, 204\u2013216 (2007)"},{"key":"689_CR6","unstructured":"Katona, G., Nemetz, T., Simonovits, M.: On a graph problem of Tur\u00e1n, Mat. Lapok 15, 228\u2013238 (1964)"},{"key":"689_CR7","unstructured":"Peng, Y.: A note on non-jumping numbers, submitted."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-006-0689-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-006-0689-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-006-0689-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:58:26Z","timestamp":1559041106000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-006-0689-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,2]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,2]]}},"alternative-id":["689"],"URL":"https:\/\/doi.org\/10.1007\/s00373-006-0689-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,2]]}}}