{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:43:11Z","timestamp":1740123791321,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,7,5]],"date-time":"2017-07-05T00:00:00Z","timestamp":1499212800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National nature science foundation of China","doi-asserted-by":"crossref","award":["11271116"],"award-info":[{"award-number":["11271116"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Order"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s11083-017-9434-3","type":"journal-article","created":{"date-parts":[[2017,7,5]],"date-time":"2017-07-05T11:15:43Z","timestamp":1499253343000},"page":"301-319","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Connection Between Polynomial Optimization and Maximum Cliques of Non-Uniform Hypergraphs"],"prefix":"10.1007","volume":"35","author":[{"given":"Pingge","family":"Chen","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":[[2017,7,5]]},"reference":[{"key":"9434_CR1","first-page":"1","volume":"2","author":"Y Chang","year":"2016","unstructured":"Chang, Y., Peng, Y., Yao, Y.: Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs. J. Comb. Optim. 2, 1\u201312 (2016)","journal-title":"J. Comb. Optim."},{"key":"9434_CR2","doi-asserted-by":"publisher","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":"9434_CR3","doi-asserted-by":"publisher","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"},{"issue":"4","key":"9434_CR4","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(4), 34 (2014). Paper 4.22","journal-title":"Electron. J. Combin."},{"key":"9434_CR5","first-page":"228","volume":"15","author":"G Katona","year":"1964","unstructured":"Katona, G., Nemetz, T., Simonovits, M.: On a problem of Tur\u00e1n in the theory of graphs. Mat. Lapok 15, 228\u2013238 (1964)","journal-title":"Mat. Lapok"},{"key":"9434_CR6","doi-asserted-by":"crossref","unstructured":"Keevash, P.: Hypergraph Tur\u00e1n Problems, Surveys in combinatorics, Cambridge University Press, pp. 83\u2013139 (2011)","DOI":"10.1017\/CBO9781139004114.004"},{"key":"9434_CR7","unstructured":"Lemons, N.W.: Tur\u00e1n Problems for Hypergraphs, dissertation, Central European University, Budapest, Hungary (2008)"},{"key":"9434_CR8","unstructured":"Luenberger, D.G.: Linear and nonlinear programming. Addison Wesley, Reading (1984)"},{"key":"9434_CR9","doi-asserted-by":"publisher","first-page":"533","DOI":"10.4153\/CJM-1965-053-6","volume":"17","author":"TS Motzkin","year":"1965","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)","journal-title":"Canad. J. Math"},{"key":"9434_CR10","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.jcta.2004.11.010","volume":"111","author":"D Mubayi","year":"2005","unstructured":"Mubayi, D., Zhao, Y.: Non-uniform Tur\u00e1n-type problems. J. Combin. Theory Ser. A 111, 106\u2013110 (2005)","journal-title":"J. Combin. Theory Ser. A"},{"key":"9434_CR11","doi-asserted-by":"publisher","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 theorem to non-uniform hypergraphs and its applications. Discrete Appl. Math. 200, 170\u2013175 (2016)","journal-title":"Discrete Appl. Math."},{"key":"9434_CR12","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s11590-008-0108-3","volume":"3","author":"S Rota Bul\u00f2","year":"2009","unstructured":"Rota Bul\u00f2, S., Pelillo, M.: A generalization of the Motzkin-Straus theorem to hypergraph. Optim. Lett. 3, 287\u2013295 (2009)","journal-title":"Optim. Lett."},{"key":"9434_CR13","first-page":"433","volume":"41","author":"AF Sidorenko","year":"1987","unstructured":"Sidorenko, A.F.: Solution of a problem of Bollob\u00e1s on 4-graphs. Mat. Zametki 41, 433\u2013455 (1987)","journal-title":"Mat. Zametki"},{"key":"9434_CR14","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1017\/S0963548301005053","volume":"11","author":"J Talbot","year":"2002","unstructured":"Talbot, J.: Lagrangians of hypergraphs. Combin. Probab. Comput. 11, 199\u2013216 (2002)","journal-title":"Combin. Probab. Comput."},{"key":"9434_CR15","first-page":"436","volume":"48","author":"P Tur\u00e1n","year":"1941","unstructured":"Tur\u00e1n, P.: On an extremal problem in graph theory (in Hungarian). Mat. Fiz. Lapok 48, 436\u2013452 (1941)","journal-title":"Mat. Fiz. Lapok"},{"key":"9434_CR16","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.dam.2017.03.014","volume":"225","author":"B Wu","year":"2017","unstructured":"Wu, B., Peng, Y.: The connection of polynomial optimization, maximum cliques and Tur\u00e1n densities. Discrete Applied Mathematics 225, 114\u2013121 (2017)","journal-title":"Discrete Applied Mathematics"}],"container-title":["Order"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11083-017-9434-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-017-9434-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-017-9434-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,11]],"date-time":"2020-10-11T15:39:56Z","timestamp":1602430796000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11083-017-9434-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,5]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["9434"],"URL":"https:\/\/doi.org\/10.1007\/s11083-017-9434-3","relation":{},"ISSN":["0167-8094","1572-9273"],"issn-type":[{"type":"print","value":"0167-8094"},{"type":"electronic","value":"1572-9273"}],"subject":[],"published":{"date-parts":[[2017,7,5]]},"assertion":[{"value":"29 March 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 June 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 July 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}