{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:09Z","timestamp":1740122409792,"version":"3.37.3"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,4,19]],"date-time":"2014-04-19T00:00:00Z","timestamp":1397865600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1007\/s10878-014-9736-y","type":"journal-article","created":{"date-parts":[[2014,4,18]],"date-time":"2014-04-18T18:16:20Z","timestamp":1397844980000},"page":"223-238","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Some Motzkin\u2013Straus type results for non-uniform hypergraphs"],"prefix":"10.1007","volume":"31","author":[{"given":"Ran","family":"Gu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xueliang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuejian","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongtang","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,4,19]]},"reference":[{"key":"9736_CR1","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1023\/A:1008230200610","volume":"10","author":"IM Bomze","year":"1997","unstructured":"Bomze IM (1997) Evolution towards the maximum clique. J Glob Optim 10:143\u2013164","journal-title":"J Glob Optim"},{"key":"9736_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 (2003) Exact bounds on the order of the maximum clique of a graph. Discret Appl Math 127:535\u2013543","journal-title":"Discret Appl Math"},{"key":"9736_CR3","first-page":"220","volume-title":"Lecture Notes in Computer Science","author":"SR Bul\u00f3","year":"2008","unstructured":"Bul\u00f3 SR, Pelillo M (2008) A continuous characterization of maximal cliques in $$k$$ k -uniform hypergraphs. In: Maniezzo V, Battiti R, Watson JP (eds) Lecture Notes in Computer Science. Spring, New York, pp 220\u2013233"},{"key":"9736_CR4","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/s11590-008-0108-3","volume":"3","author":"SR Bul\u00f3","year":"2009","unstructured":"Bul\u00f3 SR, Pelillo M (2009) A generalization of the Motzkin-Straus theorem to hypergraphs. Optim Lett 3:287\u2013295","journal-title":"Optim Lett"},{"key":"9736_CR5","first-page":"61","volume-title":"Lecture Notes in Computer Science","author":"SR Bul\u00f3","year":"2007","unstructured":"Bul\u00f3 SR, Torsello A, Pelillo M (2007) A continuous-based approach for partial clique enumeration. In: Escolano F, Vento M (eds) Lecture Notes in Computer Science, vol 4538. Spring, New York, pp 61\u201370"},{"key":"9736_CR6","doi-asserted-by":"crossref","first-page":"2080","DOI":"10.1016\/j.dam.2005.04.010","volume":"154","author":"S Busygin","year":"2006","unstructured":"Busygin S (2006) A new trust region technique for the maximum weight clique problem. Discret Appl Math 154:2080\u20132096","journal-title":"Discret Appl Math"},{"key":"9736_CR7","first-page":"305","volume":"16","author":"P Frankl","year":"1988","unstructured":"Frankl P, F\u00fcredi Z (1988) Extremal problems and the Lagrange function of hypergraphs. Bull Inst Math Acad Sin 16:305\u2013313","journal-title":"Bull Inst Math Acad Sin"},{"key":"9736_CR8","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 Ser A 52:129\u2013147","journal-title":"J Comb Theory Ser A"},{"key":"9736_CR9","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1016\/j.jctb.2006.05.004","volume":"97","author":"P Frankl","year":"2007","unstructured":"Frankl P, Peng Y, R\u00f6dl V, Talbot J (2007) A note on the jumping constant conjecture of Erd\u00f6s. J Comb Theory Ser B 97:204\u2013216","journal-title":"J Comb Theory Ser B"},{"key":"9736_CR10","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":"9736_CR11","first-page":"129","volume":"8","author":"P Frankl","year":"1989","unstructured":"Frankl P, R\u00f6dl V (1989) Some Ramsey-Tur\u00e1n type results for hypergraphs. Combinatorica 8:129\u2013147","journal-title":"Combinatorica"},{"key":"9736_CR12","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":"9736_CR13","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1016\/j.jcta.2007.05.011","volume":"115","author":"J Griggs","year":"2008","unstructured":"Griggs J, Katona G (2008) No four subsets forming an N. J Comb Theory Ser A 115:677\u2013685","journal-title":"J Comb Theory Ser A"},{"key":"9736_CR14","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1017\/S096354830999037X","volume":"18","author":"J Griggs","year":"2009","unstructured":"Griggs J, Lu L (2009) On families of subsets with a forbidden subposet. Comb Probab Comput 18:731\u2013748","journal-title":"Comb Probab Comput"},{"key":"9736_CR15","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 (2013) A hypergraph Tur\u00e1n theorem via lagrangians of intersecting families. J Combin Theory Ser A 120:2020\u20132038","journal-title":"J Combin Theory Ser A"},{"key":"9736_CR16","doi-asserted-by":"crossref","unstructured":"Johston T Lu L Tur\u00e1n problems on non-uniform hypergraphs (2013), submitted","DOI":"10.37236\/3901"},{"key":"9736_CR17","first-page":"433","volume":"41","author":"G Katona","year":"1987","unstructured":"Katona G, Nemetz T, Simonovits M (1987) On a graph problem of Bollob\u00e1s on $$4$$ 4 -graphs. Mat Zametki 41:433\u2013455","journal-title":"Mat Zametki"},{"key":"9736_CR18","volume-title":"Hypergrah Tur\u00e1n problems","author":"P Keevash","year":"2011","unstructured":"Keevash P (2011) Hypergrah Tur\u00e1n problems. Cambridge University Press, Surveys in Combinatorics"},{"key":"9736_CR19","unstructured":"Keevash P, Lenz J, Mubayi D Spectral extremal problems for hypergraphs, preprint available at arXiv:1304.0050"},{"key":"9736_CR20","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 (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":"9736_CR21","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 Tur\u00e1ns theorem. J Comb Theory Ser B 96:122\u2013134","journal-title":"J Comb Theory Ser B"},{"key":"9736_CR22","unstructured":"Nikiforov V Analytic methods for uniform hypergraphs, preprint available at arXiv:1308.1654v3"},{"key":"9736_CR23","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1080\/00207169008803851","volume":"33","author":"PM Pardalos","year":"1990","unstructured":"Pardalos PM, Phillips A (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":"9736_CR24","first-page":"485","volume-title":"Lecture Notes in Computer Science","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. In: Rangarajan A, Figueiredo A, Mrio AT, Zerubia J (eds) Lecture Notes in Computer Science. Spring, New York, pp 485\u2013500"},{"key":"9736_CR25","doi-asserted-by":"crossref","first-page":"1754","DOI":"10.1016\/j.disc.2006.09.024","volume":"307","author":"Y Peng","year":"2007","unstructured":"Peng Y (2007) Using Lagrangians of hypergrpahs to find non-jumping numbers II. Discret Math 307:1754\u20131766","journal-title":"Discret Math"},{"key":"9736_CR26","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/s00026-008-0353-2","volume":"12","author":"Y Peng","year":"2008","unstructured":"Peng Y (2008) Using Lagrangians of hypergrpahs to find non-jumping numbers I. Ann Comb 12:307\u2013324","journal-title":"Ann Comb"},{"key":"9736_CR27","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1007\/s00373-009-0859-3","volume":"25","author":"Y Peng","year":"2009","unstructured":"Peng Y (2009) On substructure densities of hypergraphs. Graphs Comb 25:583\u2013600","journal-title":"Graphs Comb"},{"key":"9736_CR28","unstructured":"Peng Y, Peng H, Tang Q, Zhao C An extension of Motzkin-Straus thorem to non-uniform hypergraphs and its applications, preprint available in arXiv:1312.4135v1"},{"key":"9736_CR29","unstructured":"Peng Y, Yao Y On polynomial optimization related to non-uniform hypergraphs, preprint available at arXiv:1312.3034v1"},{"key":"9736_CR30","doi-asserted-by":"crossref","first-page":"1856","DOI":"10.1016\/j.dam.2007.09.003","volume":"156","author":"Y Peng","year":"2008","unstructured":"Peng Y, Zhao C (2008) Generating non-jumping numbers recursively. Discret Appl Math 156:1856\u20131864","journal-title":"Discret Appl Math"},{"key":"9736_CR31","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-Straus type result for $$3$$ 3 -uniform hypergraphs. Graphs Comb 29:681\u2013694","journal-title":"Graphs Comb"},{"key":"9736_CR32","doi-asserted-by":"crossref","unstructured":"Math Notes (1987) The maximal number of edges in a homogeneous hypergraph containing no prohibited subgraphs. 41:247\u2013259 Translated from Mat. Zametki","DOI":"10.1007\/BF01158259"},{"key":"9736_CR33","first-page":"246","volume":"32","author":"VT S\u00f3s","year":"1982","unstructured":"S\u00f3s VT, Straus EG (1982) Extremals of functions on graphs with applications to graphs and hypergraphs. J. Combin. Theory. Ser A 32:246\u2013257","journal-title":"Ser A"},{"key":"9736_CR34","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":"9736_CR35","unstructured":"Tang Q, Peng Y, Zhang X, Zhao C (2013) Some results on Lagrangians of hypergraphs. Discret Appl Math. http:\/\/dx.doi.org\/10.10.16\/j.dam.2013.09.023"},{"key":"9736_CR36","unstructured":"Tang Q, Peng Y, Zhang X, Zhao C On graph-Lagrangians of hypergraphs containing dense subgraphs. J. Optimiz. Theory App. 10.1007\/s10957-013-0485-3"},{"key":"9736_CR37","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"},{"key":"9736_CR38","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 numbers of graphs. J Comb Theory Ser B 40:113\u2013117","journal-title":"J Comb Theory Ser B"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9736-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-014-9736-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9736-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,18]],"date-time":"2020-08-18T01:30:36Z","timestamp":1597714236000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-014-9736-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,19]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["9736"],"URL":"https:\/\/doi.org\/10.1007\/s10878-014-9736-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2014,4,19]]}}}