{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T18:08:20Z","timestamp":1649095700185},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,11,1]],"date-time":"2009-11-01T00:00:00Z","timestamp":1257033600000},"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":[[2009,11]]},"DOI":"10.1007\/s00373-009-0859-3","type":"journal-article","created":{"date-parts":[[2009,12,11]],"date-time":"2009-12-11T09:35:40Z","timestamp":1260524140000},"page":"583-600","source":"Crossref","is-referenced-by-count":4,"title":["On Substructure Densities of Hypergraphs"],"prefix":"10.1007","volume":"25","author":[{"given":"Yuejian","family":"Peng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,12,12]]},"reference":[{"key":"859_CR1","unstructured":"Erd\u00f6s, P.: On extremal problems of graphs and generalized graphs. Israel J. Math. 2, 183\u2013190 (1964)"},{"key":"859_CR2","doi-asserted-by":"crossref","unstructured":"Erd\u00f6s, P., Stone, A.H.: On the structure of linear graphs. Bull. Amer. Math. Soc. 52, 1087\u20131091 (1946)","DOI":"10.1090\/S0002-9904-1946-08715-7"},{"key":"859_CR3","unstructured":"Frankl, P., F\u00fcredi, Z.: Extremal problems whose solutions are the blow-ups of the small Witt-designs. J. Comb. Theory A 52, 129\u2013147 (1989)"},{"key":"859_CR4","doi-asserted-by":"crossref","unstructured":"Frankl, P., R\u00f6dl, V.: Hypergraphs do not jump. Combinatorica 4, 149\u2013159 (1984)","DOI":"10.1007\/BF02579215"},{"key":"859_CR5","unstructured":"Frankl, P., Peng, Y., R\u00f6dl, V., Talbot, J.: A note on the jumping constant conjecture of Erd\u00f6s. J. Comb. Theory Ser. B. 97, 204\u2013216 (2007)"},{"key":"859_CR6","unstructured":"Katona, G., Nemetz, T., Simonovits, M.: On a graph-problem of Tur\u00e1n. Mat. Fiz. Lapok 48, 436\u2013452 (1941)"},{"key":"859_CR7","unstructured":"Motzkin, T.S., Straus, E.G.: Maxima for graphs and a new proof of a theorem of Tur\u00e1n. Can. J. Math 17, 533\u2013540 (1965)"},{"key":"859_CR8","doi-asserted-by":"crossref","unstructured":"Peng, Y.: Non-jumping numbers for 4-uniform hypergraphs. Graphs Comb. 23, 97\u2013110 (2007)","DOI":"10.1007\/s00373-006-0689-5"},{"key":"859_CR9","doi-asserted-by":"crossref","unstructured":"Peng, Y.: Using Lagrangians of hypergraphs to find non-jumping numbers(I). Ann. Comb. 12(3), 307\u2013324 (2008)","DOI":"10.1007\/s00026-008-0353-2"},{"key":"859_CR10","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":"859_CR11","doi-asserted-by":"crossref","unstructured":"Peng, Y.: Subgraph densities in hypergraphs. Discuss. Math. Graph Theory 27(2), 281\u2013298 (2007)","DOI":"10.7151\/dmgt.1361"},{"key":"859_CR12","doi-asserted-by":"crossref","unstructured":"Peng, Y.: A note on the structure of Tur\u00e1n densities. Graphs Comb. 24(2), 113\u2013125 (2008)","DOI":"10.1007\/s00373-008-0773-0"},{"key":"859_CR13","unstructured":"Peng, Y.: On jumping densities of hypergraphs. Graphs Comb., in press"},{"key":"859_CR14","unstructured":"Peng, Y., Zhao, C.: Generating non-jumping numbers recursively. Discrete Appl. Math. 156(10), 1856\u20131864 (2008)"},{"key":"859_CR15","doi-asserted-by":"crossref","unstructured":"Peng, Y., Zhao, C.: On non-strong jumping numbers and density structures of hypergraphs. Discrete Math. 309, 3917\u20133929 (2009)","DOI":"10.1016\/j.disc.2008.11.007"},{"key":"859_CR16","doi-asserted-by":"crossref","unstructured":"Talbot, J.: Lagrangians of hypergraphs. Comb. Prob. Comput. 11, 199\u2013216 (2002)","DOI":"10.1017\/S0963548301005053"},{"key":"859_CR17","unstructured":"Tur\u00e1n, P.: On an extremal problem in graph theory. Mat. Fiz. Lapok 48, 436\u2013452 (1941) (in Hungarian)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-009-0859-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-009-0859-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-009-0859-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:29Z","timestamp":1559055509000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-009-0859-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,11]]}},"alternative-id":["859"],"URL":"https:\/\/doi.org\/10.1007\/s00373-009-0859-3","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,11]]}}}