{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T19:42:33Z","timestamp":1648755753990},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,10,30]],"date-time":"2013-10-30T00:00:00Z","timestamp":1383091200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1007\/s10878-013-9671-3","type":"journal-article","created":{"date-parts":[[2013,10,29]],"date-time":"2013-10-29T04:15:09Z","timestamp":1383020109000},"page":"812-825","source":"Crossref","is-referenced-by-count":5,"title":["On Lagrangians of r-uniform hypergraphs"],"prefix":"10.1007","volume":"30","author":[{"given":"Yuejian","family":"Peng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qingsong","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cheng","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,10,30]]},"reference":[{"key":"9671_CR1","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1016\/S0166-218X(02)00386-4","volume":"127","author":"M Budinich","year":"2003","unstructured":"Budinich M (2003) Exact bounds on the order of the maximum clique of a graph. Discrete Appl Math 127:535\u2013543","journal-title":"Discrete Appl Math"},{"issue":"4","key":"9671_CR2","doi-asserted-by":"crossref","first-page":"2080","DOI":"10.1016\/j.dam.2005.04.010","volume":"304","author":"S Busygin","year":"2006","unstructured":"Busygin S (2006) A new trust region technique for the maximum weight clique problem. Discrete Appl Math 304(4):2080\u20132096","journal-title":"Discrete Appl Math"},{"key":"9671_CR3","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 (A) 52:129\u2013147","journal-title":"J Comb Theory (A)"},{"key":"9671_CR4","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":"9671_CR5","doi-asserted-by":"crossref","first-page":"754","DOI":"10.1287\/moor.22.3.754","volume":"22","author":"LE Gibbons","year":"1997","unstructured":"Gibbons LE, Hearn DW, Pardalos PM, Ramana MV (1997) Continuous characterizations of the maximum clique problem. Math Oper Res 22:754\u2013768","journal-title":"Math Oper Res"},{"key":"9671_CR6","unstructured":"He G, Peng Y, Zhao C, On finding Lagrangians of 3-uniform hypergraphs, Ars Combinatoria (accepted)"},{"key":"9671_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":"9671_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 (2006) A hypergraph extension of Turan\u2019s theorem. J Comb Theory B 96:122\u2013134","journal-title":"J Comb Theory B"},{"key":"9671_CR9","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/978-3-540-45063-4_31","volume":"2683","author":"M Pavan","year":"2003","unstructured":"Pavan M, Pelillo M (2003) Generalizing the motzkin-straus theorem to edge-weighted graphs, with applications to image segmentation. Lect Notes Comput Sci 2683:485\u2013500","journal-title":"Lect Notes Comput Sci"},{"key":"9671_CR10","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1080\/00207169008803851","volume":"33","author":"PM Pardalos","year":"1990","unstructured":"Pardalos PM, Phillips AT (1990) A global optimization approach for solving the maximum clique problem. Int J Comput Math 33:209\u2013216","journal-title":"Int J Comput Math"},{"key":"9671_CR11","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 (2013) A Motzkin\u2013Straus type result for 3-uniform hypergraphs. Graphs Comb 29:681\u2013694","journal-title":"Graphs Comb"},{"key":"9671_CR12","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/978-3-642-25789-6_2","volume":"125","author":"Y Peng","year":"2012","unstructured":"Peng Y, Zhao C (2012) On Lagrangians of hypergraphs and cliques. Recent Adv Comput Sci Inf Eng 125:7\u201312","journal-title":"Recent Adv Comput Sci Inf Eng"},{"key":"9671_CR13","unstructured":"Peng Y, Zhu HG, Zheng Y, Zhao C On cliques and Lagrangians of 3-uniform hypergraphs. http:\/\/arxiv.org\/abs\/1211.6508"},{"key":"9671_CR14","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1007\/978-3-540-92695-5_17","volume":"5313","author":"S Rota Bul\u00f3","year":"2008","unstructured":"Rota Bul\u00f3 S, Pelillo M (2008) A continuous characterization of maximal cliques in k-uniform hypergraphs. Learn Intellig Optim 5313:220\u2013233","journal-title":"Learn Intellig Optim"},{"issue":"2","key":"9671_CR15","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/s11590-008-0108-3","volume":"3","author":"S Rota Bul\u00f3","year":"2009","unstructured":"Rota Bul\u00f3 S, Pelillo M (2009) A generalization of the Motzkin\u2013Straus theorem to hypergraphs. Optim Lett 3(2):287\u2013295","journal-title":"Optim Lett"},{"key":"9671_CR16","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/978-3-540-72903-7_6","volume":"4538","author":"S Rota Bul\u00f3","year":"2007","unstructured":"Rota Bul\u00f3 S, Torsello A, Pelillo M (2007) A continuous-based approach for partial clique enumeration. Graph-Based Represent Patt Recogn 4538:61\u201370","journal-title":"Graph-Based Represent Patt Recogn"},{"key":"9671_CR17","first-page":"433","volume":"41","author":"AF Sidorenko","year":"1987","unstructured":"Sidorenko AF (1987) Solution of a problem of Bollob\u00e1s on 4-graphs. Mat Zametki 41:433\u2013455","journal-title":"Mat Zametki"},{"key":"9671_CR18","first-page":"189","volume":"63","author":"V S\u00f3s","year":"1982","unstructured":"S\u00f3s V, Straus EG (1982) Extremal of functions on graphs with applications to graphs and hypergraphs. J Comb Theory B 63:189\u2013207","journal-title":"J Comb Theory B"},{"key":"9671_CR19","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. Comb Probab Comput 11:199\u2013216","journal-title":"Comb Probab Comput"},{"key":"9671_CR20","doi-asserted-by":"crossref","unstructured":"Tang QS, Peng YJ, Zhang XD, Zhao C Some results on Lagrangians of hypergraphs. Discrete Appl Math (accepted)","DOI":"10.1016\/j.dam.2013.09.023"},{"key":"9671_CR21","unstructured":"Tang QS, Peng YJ, Zhang XD, Zhao C On Frankl and F\u00fcredi\u2019s conjecture for $$3$$ 3 -uniform hypergraphs. http:\/\/arxiv.org\/abs\/1211.7056"},{"key":"9671_CR22","first-page":"436","volume":"48","author":"P Tur\u00e1n","year":"1941","unstructured":"Tur\u00e1n P (1941) On an extremal problem in graph theory. Mat Fiz Lapok 48:436\u2013452 (in Hungarian)","journal-title":"Mat Fiz Lapok"},{"key":"9671_CR23","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0095-8956(86)90069-9","volume":"40","author":"HS Wilf","year":"1986","unstructured":"Wilf HS (1986) Spectral bounds for the clique and independence number of graphs. J Comb Theory B 40:113\u2013117","journal-title":"J Comb Theory B"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9671-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9671-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9671-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:22Z","timestamp":1559276602000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9671-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,30]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["9671"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9671-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,30]]}}}