{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T12:25:43Z","timestamp":1649161543782},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,4,1]],"date-time":"2008-04-01T00:00:00Z","timestamp":1207008000000},"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,4]]},"DOI":"10.1007\/s00373-008-0773-0","type":"journal-article","created":{"date-parts":[[2008,5,14]],"date-time":"2008-05-14T13:59:19Z","timestamp":1210773559000},"page":"113-125","source":"Crossref","is-referenced-by-count":4,"title":["A note on the Structure of Tur\u00e1n Densities of Hypergraphs"],"prefix":"10.1007","volume":"24","author":[{"given":"Yuejian","family":"Peng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,5,15]]},"reference":[{"key":"773_CR1","unstructured":"Erd\u0151s, P.: On extremal problems of graphs and generalized graphs. Israel J. Math. 2, 183\u2013190 (1964)"},{"key":"773_CR2","unstructured":"Erd\u0151s, P., Simonovits, M.: A limit theorem in graph theory. Studia Sci. Mat. Hung. Acad. 1, 51\u201357 (1966)"},{"key":"773_CR3","unstructured":"Erd\u0151s, P., Stone, A.H.: On the structure of linear graphs. Bull. Amer. Math. Soc. 52, 1087\u20131091 (1946)"},{"key":"773_CR4","doi-asserted-by":"crossref","unstructured":"Frankl, P., F\u00fcredi, Z.: Extremal problems whose solutions are the blow-ups of the small Witt-designs. J. Combin. Theory (A) 52, 129\u2013147 (1989)","DOI":"10.1016\/0097-3165(89)90067-8"},{"key":"773_CR5","doi-asserted-by":"crossref","unstructured":"Frankl, P., R\u00f6dl, V.: Hypergraphs do not jump. Combin. 4, 149\u2013159 (1984)","DOI":"10.1007\/BF02579215"},{"key":"773_CR6","doi-asserted-by":"crossref","unstructured":"Frankl, P., Peng, Y., R\u00f6dl, V., Talbot, J.: A note on the jumping constant conjecture of Erd\u0151s. J. Combin. Theory (B) 97, 204\u2013216 (2007)","DOI":"10.1016\/j.jctb.2006.05.004"},{"key":"773_CR7","unstructured":"Katona, G., Nemetz, T., Simonovits, M.: On a graph problem of Tur\u00e1n. Mat. Lapok 15, 228\u2013238 (1964)"},{"key":"773_CR8","unstructured":"Motzkin, T.S., Straus, E.G.: Maxima for graphs and a new proof of a theorem of Tur\u00e1n. Canad. J. Math 17, 533\u2013540 (1965)"},{"key":"773_CR9","doi-asserted-by":"crossref","unstructured":"Peng, Y.: Non-jumping numbers for 4-uniform hypergraphs. Graphs and Combinatorics 23, 97\u2013110 (2007)","DOI":"10.1007\/s00373-006-0689-5"},{"key":"773_CR10","unstructured":"Peng, Y.: Using Lagrangians of hypergraphs to find non-jumping numbers(I), accepted by Annals of Combinatorics, in press"},{"key":"773_CR11","doi-asserted-by":"crossref","unstructured":"Peng, Y.: Using Lagrangians of hypergraphs to find non-jumping numbers(II). Discrete Math. 307, 1754\u20131766 (2007)","DOI":"10.1016\/j.disc.2006.09.024"},{"key":"773_CR12","doi-asserted-by":"crossref","unstructured":"Peng, Y.: Subgraph densities in hypergraphs. Discussiones Math. Graph Theory 27(2), 281\u2013298 (2007)","DOI":"10.7151\/dmgt.1361"},{"key":"773_CR13","unstructured":"Peng, Y., Zhao, C.: Generating non-jumping numbers recursively. Discrete Applied Math., in press"},{"key":"773_CR14","doi-asserted-by":"crossref","unstructured":"Talbot, J.: Lagrangians of hypergraphs. Combinatorics, Probability and Computing 11, 199\u2013216 (2002)","DOI":"10.1017\/S0963548301005053"},{"key":"773_CR15","unstructured":"Tur\u00e1n, P.: On an extremal problem in graph theory (in Hungarian). Mat. Fiz. Lapok 48, 436\u2013452 (1941)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-008-0773-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-008-0773-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-008-0773-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:58:28Z","timestamp":1559041108000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-008-0773-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,4]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,4]]}},"alternative-id":["773"],"URL":"https:\/\/doi.org\/10.1007\/s00373-008-0773-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,4]]}}}