{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:19:52Z","timestamp":1740122392021,"version":"3.37.3"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,11,2]],"date-time":"2017-11-02T00:00:00Z","timestamp":1509580800000},"content-version":"unspecified","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":["11671124"],"award-info":[{"award-number":["11671124"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1007\/s10878-017-0196-z","type":"journal-article","created":{"date-parts":[[2017,11,2]],"date-time":"2017-11-02T02:49:30Z","timestamp":1509590970000},"page":"588-612","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Two extremal problems related to orders"],"prefix":"10.1007","volume":"35","author":[{"given":"Biao","family":"Wu","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,11,2]]},"reference":[{"key":"196_CR1","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 (1989) Extremal problems whose solutions are the blow-ups of the small Witt-designs. J Comb Theory 52:129\u2013147","journal-title":"J Comb Theory"},{"key":"196_CR2","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/BF02579215","volume":"4","author":"P Frankl","year":"1984","unstructured":"Frankl P, R\u00f6dl V (1984) Hypergraphs do not jump. Combinatorica 4:149\u2013159","journal-title":"Combinatorica"},{"key":"196_CR3","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/s10107-010-0409-z","volume":"125","author":"S He","year":"2010","unstructured":"He S, Li Z, Zhang S (2010) Approximation algorithms for homogenous polynomial optimization with quadratic constraints. Math Program Ser B 125:353\u2013383","journal-title":"Math Program Ser B"},{"key":"196_CR4","first-page":"83","volume-title":"Hypergrah Tur\u00e1n problems, surveys in combinatorics","author":"P Keevash","year":"2011","unstructured":"Keevash P (2011) Hypergrah Tur\u00e1n problems, surveys in combinatorics. Cambridge University Press, Cambridge, pp 83\u2013140"},{"key":"196_CR5","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1093\/biomet\/asr015","volume":"98","author":"H Kim","year":"2011","unstructured":"Kim H (2011) The union closure method for testing a fixed sequence of families of hypotheses. Biometrika 98:391\u2013401","journal-title":"Biometrika"},{"key":"196_CR6","first-page":"67","volume":"52","author":"U Leck","year":"2012","unstructured":"Leck U, Roberts I, Simpson J (2012) Minimizing the weight of the union-closure of families of two-sets. Australas J Combin 52:67\u201373","journal-title":"Australas J Combin"},{"key":"196_CR7","doi-asserted-by":"crossref","first-page":"533","DOI":"10.4153\/CJM-1965-053-6","volume":"17","author":"TS Motzkin","year":"1965","unstructured":"Motzkin TS, Straus EG (1965) Maxima for graphs and a new proof of a theorem of Tur\u00e1n. Can J Math 17:533\u2013540","journal-title":"Can J Math"},{"key":"196_CR8","first-page":"433","volume":"41","author":"AF Sidorenko","year":"1987","unstructured":"Sidorenko AF (1987) Solution of a problem of Bollobas on 4-graphs. Mat Zametki 41:433\u2013455","journal-title":"Mat Zametki"},{"issue":"1","key":"196_CR9","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/s10957-013-0519-x","volume":"163","author":"YP Sun","year":"2014","unstructured":"Sun YP, Tang QS, Zhao C, Peng Y (2014) On the largest graph-Lagrangian of 3-graphs with fixed number of edges. J Optim Theory Appl 163(1):57\u201379","journal-title":"J Optim Theory Appl"},{"issue":"1","key":"196_CR10","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/s10255-015-0513-1","volume":"32","author":"QS Tang","year":"2016","unstructured":"Tang QS, Peng H, Wang C, Peng Y (2016) On Frankl and F\u00fcredi\u2019s conjecture for 3-uniform hypergraphs. Acta Math Appl Sin English Ser 32(1):95\u2013112","journal-title":"Acta Math Appl Sin English Ser"},{"key":"196_CR11","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1016\/j.dam.2013.09.023","volume":"166","author":"QS Tang","year":"2014","unstructured":"Tang QS, Peng Y, Zhang XD, Zhao C (2014) Some results on Lagrangians of hypergraphs. Discrete Appl Math 166:222\u2013238","journal-title":"Discrete Appl Math"},{"issue":"4","key":"196_CR12","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1007\/s11590-015-0907-2","volume":"10","author":"QS Tang","year":"2016","unstructured":"Tang QS, Peng Y, Zhang XD, Zhao C (2016) Connection between the clique number and the Lagrangian of 3-uniform hypergraphs. Optim Lett 10(4):685\u2013697","journal-title":"Optim Lett"},{"key":"196_CR13","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1017\/S0963548301005053","volume":"11","author":"J Talbot","year":"2002","unstructured":"Talbot J (2002) Lagrangians of hypergraphs. Combin Probab Comput 11:199\u2013216","journal-title":"Combin Probab Comput"},{"key":"196_CR14","first-page":"436","volume":"48","author":"P Tur\u00e1n","year":"1941","unstructured":"Tur\u00e1n P (1941) On an extremal problem in graph theory (in Hungarian). Mat Fiz Lapok 48:436\u2013452","journal-title":"Mat Fiz Lapok"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-017-0196-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0196-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0196-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,2,9]],"date-time":"2018-02-09T07:42:42Z","timestamp":1518162162000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-017-0196-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,2]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,2]]}},"alternative-id":["196"],"URL":"https:\/\/doi.org\/10.1007\/s10878-017-0196-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2017,11,2]]}}}