{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:08:14Z","timestamp":1758823694780},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,2,16]],"date-time":"2012-02-16T00:00:00Z","timestamp":1329350400000},"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":[[2013,5]]},"DOI":"10.1007\/s00373-012-1135-5","type":"journal-article","created":{"date-parts":[[2012,2,15]],"date-time":"2012-02-15T06:21:24Z","timestamp":1329286884000},"page":"681-694","source":"Crossref","is-referenced-by-count":12,"title":["A Motzkin\u2013Straus Type Result for 3-Uniform Hypergraphs"],"prefix":"10.1007","volume":"29","author":[{"given":"Yuejian","family":"Peng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cheng","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,2,16]]},"reference":[{"issue":"2","key":"1135_CR1","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1023\/A:1008230200610","volume":"10","author":"I.M. Bomze","year":"1997","unstructured":"Bomze I.M.: Evolution towards the maximum clique. J. Global Optimiz. 10(2), 143\u2013164 (1997)","journal-title":"J. Global Optimiz."},{"key":"1135_CR2","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.: Exact bounds on the order of the maximum clique of a graph. Discrete Appl. Math. 127, 535\u2013543 (2003)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"1135_CR3","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.: A new trust region technique for the maximum weight clique problem. Discrete Appl. Math. 304(4), 2080\u20132096 (2006)","journal-title":"Discrete Appl. Math."},{"key":"1135_CR4","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 (A) 52, 129\u2013147 (1989)","journal-title":"J. Combin Theory (A)"},{"key":"1135_CR5","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/BF02579215","volume":"4","author":"P. Frankl","year":"1984","unstructured":"Frankl P., R\u00f6dl V.: Hypergraphs do not jump. Combinatorica 4, 149\u2013159 (1984)","journal-title":"Combinatorica"},{"key":"1135_CR6","doi-asserted-by":"crossref","first-page":"754","DOI":"10.1287\/moor.22.3.754","volume":"22","author":"L.E. Gibbons","year":"1997","unstructured":"Gibbons L.E., Hearn D.W., Pardalos P.M., Ramana M.V.: Continuous characterizations of the maximum clique problem. Math. Oper. Res. 22, 754\u2013768 (1997)","journal-title":"Math. Oper. Res."},{"key":"1135_CR7","unstructured":"He, G., Peng, Y., Zhao, C.: On finding Lagrangians of 3-uniform hypergraphs. Ars Combin. (accepted)"},{"key":"1135_CR8","doi-asserted-by":"crossref","first-page":"533","DOI":"10.4153\/CJM-1965-053-6","volume":"17","author":"T.S. Motzkin","year":"1965","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)","journal-title":"Can. J. Math."},{"key":"1135_CR9","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 Turan\u2019s theorem. J. Combin. Theory Ser. B 96, 122\u2013134 (2006)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1135_CR10","doi-asserted-by":"crossref","unstructured":"Pavan, M., Pelillo, M.: Generalizing the Motzkin\u2013Straus theorem to edge-weighted graphs, with applications to image segmentation. EMMCVPR, pp. 485\u2013500 (2003)","DOI":"10.1007\/978-3-540-45063-4_31"},{"key":"1135_CR11","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1080\/00207169008803851","volume":"33","author":"P.M. Pardalos","year":"1990","unstructured":"Pardalos P.M., Phillips A.T.: A global optimization approach for solving the maximum clique problem. Int. J. Comput. Math. 33, 209\u2013216 (1990)","journal-title":"Int. J. Comput. Math."},{"key":"1135_CR12","unstructured":"Peng, Y., Tang, Q.S., Zhao, C.: A Result on Lagrangians of r-uniform Hypergraphs (submitted)"},{"key":"1135_CR13","unstructured":"Peng, Y., Zhu, H., Zhao, C.: On Cliques and Lagrangians of Hypergraphs, (manuscript)"},{"key":"1135_CR14","doi-asserted-by":"crossref","unstructured":"Bul\u00f3, S.R., Pelillo, M.: A continuous characterization of maximal cliques in k-uniform hypergraphs. In: Learning and Intelligent Optimization, pp. 220\u2013233 (2008)","DOI":"10.1007\/978-3-540-92695-5_17"},{"issue":"2","key":"1135_CR15","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/s11590-008-0108-3","volume":"3","author":"S.R. Bul\u00f3","year":"2009","unstructured":"Bul\u00f3 S.R., Pelillo M.: A generalization of the Motzkin\u2013Straus theorem to hypergraphs. Optim. Lett. 3(2), 287\u2013295 (2009)","journal-title":"Optim. Lett."},{"key":"1135_CR16","doi-asserted-by":"crossref","unstructured":"Bul\u00f3, S.R., Torsello, A., Pelillo, M.: A continuous-based approach for partial clique enumeration. Graph-Based Representations Pattern Recognition, pp. 61\u201370 (2007)","DOI":"10.1007\/978-3-540-72903-7_6"},{"key":"1135_CR17","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BF02124681","volume":"9","author":"A.F. Sidorenko","year":"1989","unstructured":"Sidorenko A.F.: Asymptotic solution for a new class of forbidden r-graphs. Combinatorica 9, 207\u2013215 (1989)","journal-title":"Combinatorica"},{"key":"1135_CR18","first-page":"189","volume":"63","author":"V. S\u00f3s","year":"1982","unstructured":"S\u00f3s V., Straus E.G.: Extremal of functions on graphs with applications to graphs and hypergraphs. J. Combin. Theory Ser. B 63, 189\u2013207 (1982)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1135_CR19","unstructured":"Ruszczyn\u015bki, A.: Nonlinear optimization. Princeton University Press, Princeton (2006)"},{"key":"1135_CR20","doi-asserted-by":"crossref","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":"1135_CR21","first-page":"436","volume":"48","author":"P. Tur\u00e1n","year":"1941","unstructured":"Tur\u00e1n P.: On an extremal problem in graph theory. Mat. Fiz. Lapok 48, 436\u2013452 (1941) (in Hungarian)","journal-title":"Mat. Fiz. Lapok"},{"key":"1135_CR22","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0095-8956(86)90069-9","volume":"40","author":"H.S. Wilf","year":"1986","unstructured":"Wilf H.S.: Spectral bounds for the clique and independence number of graphs. J. Combin. Theory Ser. B 40, 113\u2013117 (1986)","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1135-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1135-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1135-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,23]],"date-time":"2019-06-23T15:00:41Z","timestamp":1561302041000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1135-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,16]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,5]]}},"alternative-id":["1135"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1135-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2,16]]}}}