{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:43:10Z","timestamp":1740123790186,"version":"3.37.3"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,1,24]],"date-time":"2016-01-24T00:00:00Z","timestamp":1453593600000},"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":["11271116"],"award-info":[{"award-number":["11271116"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Order"],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s11083-016-9385-0","type":"journal-article","created":{"date-parts":[[2016,1,24]],"date-time":"2016-01-24T06:08:30Z","timestamp":1453615710000},"page":"9-21","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Note on Generalized Lagrangians of Non-uniform Hypergraphs"],"prefix":"10.1007","volume":"34","author":[{"given":"Yuejian","family":"Peng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Biao","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuping","family":"Yao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,1,24]]},"reference":[{"key":"9385_CR1","first-page":"305","volume":"16","author":"P Frankl","year":"1988","unstructured":"Frankl, P., F\u00fcredi, Z.: Extremal problems and the Lagrange function of hypergraphs. Bulletin Institute Math. Academia Sinica 16, 305\u2013313 (1988)","journal-title":"Bulletin Institute Math. Academia Sinica"},{"key":"9385_CR2","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0097-3165(89)90067-8","volume":"52","author":"P Frankl","year":"1989","unstructured":"Frankl, P., F\u00fcredi, Z.: Extremal problems whose solutions are the blow-ups of the small Witt-designs. J. Combin. Theory Ser. A 52, 129\u2013147 (1989)","journal-title":"J. Combin. Theory Ser. A"},{"key":"9385_CR3","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s10878-014-9736-y","volume":"31","author":"R Gu","year":"2016","unstructured":"Gu, R., Li, X., Peng, Y., Shi, Y.: Some Motzkin-Straus type results for non-uniform hypergraphs. J. Comb. Optim. 31, 223\u2013238 (2016)","journal-title":"J. Comb. Optim."},{"key":"9385_CR4","doi-asserted-by":"crossref","first-page":"2020","DOI":"10.1016\/j.jcta.2013.07.011","volume":"120","author":"D Hefetz","year":"2013","unstructured":"Hefetz, D., Keevash, P.: A hypergraph Tur\u00e1n theorem via lagrangians of intersecting families. J. Combin. Theory Ser. A 120, 2020\u20132038 (2013)","journal-title":"J. Combin. Theory Ser. A"},{"key":"9385_CR5","doi-asserted-by":"crossref","first-page":"34","DOI":"10.37236\/3901","volume":"21","author":"T Johnston","year":"2014","unstructured":"Johnston, T., Lu, L.: Tur\u00e1n problems on non-uniform hypergraphs. Electron. J. Combin. 21, 34 (2014). Paper 4.22","journal-title":"Electron. J. Combin."},{"key":"9385_CR6","first-page":"83","volume-title":"Hypergrah Tur\u00e1n problems. Surveys in Combinatorics","author":"P Keevash","year":"2011","unstructured":"Keevash, P.: Hypergrah Tur\u00e1n problems. Surveys in Combinatorics, pp 83\u2013140. Cambridge University Press, Cambridge (2011)"},{"key":"9385_CR7","doi-asserted-by":"crossref","first-page":"533","DOI":"10.4153\/CJM-1965-053-6","volume":"17","author":"T Motzkin","year":"1965","unstructured":"Motzkin, T., Straus, E.: Maxima for graphs and a new proof of a theorem of Tur\u00e1n. Canad. J. Math. 17, 533\u2013540 (1965)","journal-title":"Canad. J. Math."},{"key":"9385_CR8","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/j.jctb.2005.06.013","volume":"96","author":"D Mubayi","year":"2006","unstructured":"Mubayi, D.: A hypergraph extension of Turans theorem. J. Combin. Theory Ser. B 96, 122\u2013134 (2006)","journal-title":"J. Combin. Theory Ser. B"},{"key":"9385_CR9","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/j.dam.2015.06.037","volume":"200","author":"Y Peng","year":"2016","unstructured":"Peng, Y., Peng, H., Tang, Q., Zhao, C.: An extension of Motzkin-Straus Thorem to non-uniform hypergraphs and its applications. Discret. Appl. Math. 200, 170\u2013175 (2016)","journal-title":"Discret. Appl. Math."},{"key":"9385_CR10","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1007\/s00373-012-1135-5","volume":"29","author":"Y Peng","year":"2013","unstructured":"Peng, Y., Zhao, C.: A Motzkin-Straus type result for 3-uniform hypergraphs. Graphs Combin. 29, 681\u2013694 (2013)","journal-title":"Graphs Combin."},{"key":"9385_CR11","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF01158259","volume":"41","author":"A Sidorenko","year":"1987","unstructured":"Sidorenko, A.: The maximal number of edges in a homogeneous hypergraph containing no prohibited subgraphs. Math Notes 41, 247\u2013259 (1987). Translated from Mat. Zametki.","journal-title":"Math Notes"},{"key":"9385_CR12","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/s10957-013-0519-x","volume":"163","author":"Y Sun","year":"2014","unstructured":"Sun, Y., Tang, Q.S., Zhao, C., Peng, Y.: On the largest Lagrangian of 3-graphs with fixed number of edges. J. Optimiz. Theory App. 163, 57\u201379 (2014)","journal-title":"J. Optimiz. Theory App."},{"key":"9385_CR13","author":"QS Tang","year":"2016","unstructured":"Tang, Q.S., Peng, Y., Zhang, X.D., Zhao, C.: Connection between the clique number and the Lagrangian of 3-uniform hypergraphs. Optim. Lett. (2016). doi: 10.1007\/s11590-015-0907-2","journal-title":"Optim. Lett."},{"key":"9385_CR14","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1017\/S0963548301005053","volume":"11","author":"J Talbot","year":"2002","unstructured":"Talbot, J.: Lagrangians of hypergraphs. Comb. Probab. Comput. 11, 199\u2013216 (2002)","journal-title":"Comb. Probab. Comput."}],"container-title":["Order"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-016-9385-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11083-016-9385-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-016-9385-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-016-9385-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,14]],"date-time":"2020-09-14T09:33:28Z","timestamp":1600076008000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11083-016-9385-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,24]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["9385"],"URL":"https:\/\/doi.org\/10.1007\/s11083-016-9385-0","relation":{},"ISSN":["0167-8094","1572-9273"],"issn-type":[{"type":"print","value":"0167-8094"},{"type":"electronic","value":"1572-9273"}],"subject":[],"published":{"date-parts":[[2016,1,24]]}}}