{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T01:38:01Z","timestamp":1772329081229,"version":"3.50.1"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,11,24]],"date-time":"2009-11-24T00:00:00Z","timestamp":1259020800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2010,4]]},"DOI":"10.1007\/s00186-009-0295-4","type":"journal-article","created":{"date-parts":[[2009,11,23]],"date-time":"2009-11-23T09:04:10Z","timestamp":1258967050000},"page":"267-281","source":"Crossref","is-referenced-by-count":2,"title":["A simpler characterization of a spectral lower bound on the clique number"],"prefix":"10.1007","volume":"71","author":[{"given":"E. Alper","family":"Y\u0131ld\u0131r\u0131m","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,11,24]]},"reference":[{"key":"295_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":"295_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-1-4757-3023-4_1","volume-title":"Handbook of combinatorial optimization (supplement volume A)","author":"IM Bomze","year":"1999","unstructured":"Bomze IM, Budinich M, Pardalos PM, Pelillo M (1999) The maximum clique problem. In: Du DZ, Pardalos PM (eds) Handbook of combinatorial optimization (supplement volume A). Kluwer, Boston, pp 1\u201374"},{"key":"295_CR3","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":"295_CR4","volume-title":"Spectra of graphs. Pure and applied mathematics","author":"DM Cvetkovi\u0107","year":"1979","unstructured":"Cvetkovi\u0107 DM, Doob M, Sachs H (1979) Spectra of graphs. Pure and applied mathematics. Academic Press, New York"},{"key":"295_CR5","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1016\/j.jctb.2007.10.007","volume":"98","author":"CD Godsil","year":"2008","unstructured":"Godsil CD, Newman MW (2008) Eigenvalue bounds for independent sets. J Comb Theory Ser B 98: 721\u2013734","journal-title":"J Comb Theory Ser B"},{"key":"295_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric algorithms and combinatorial optimization","author":"M Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel M, Lov\u00e1sz L, Schrijver A (1988) Geometric algorithms and combinatorial optimization. Springer, New York"},{"issue":"1","key":"295_CR7","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02392825","volume":"182","author":"J Hastad","year":"1999","unstructured":"Hastad J (1999) Clique is hard to approximate within $${n^{1-\\epsilon}}$$ . Acta Math 182(1): 105\u2013142","journal-title":"Acta Math"},{"key":"295_CR8","doi-asserted-by":"crossref","first-page":"726","DOI":"10.1016\/j.jctb.2006.12.003","volume":"97","author":"M Lu","year":"2007","unstructured":"Lu M, Liu H, Tian F (2007) Laplacian spectral bounds for clique and independence numbers of graphs. J Comb Theory Ser B 97: 726\u2013732","journal-title":"J Comb Theory Ser B"},{"key":"295_CR9","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":"295_CR10","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1016\/j.disc.2006.01.014","volume":"306","author":"V Nikiforov","year":"2006","unstructured":"Nikiforov V (2006) The smallest eigenvalue of K r -free graphs. Discret Math 306: 612\u2013616","journal-title":"Discret Math"},{"key":"295_CR11","doi-asserted-by":"crossref","unstructured":"Nikiforov V (2009) More spectral bounds on the clique and independence numbers. J Comb Theory Ser B. doi: 10.1016\/j.jctb.2009.01.003","DOI":"10.1016\/j.jctb.2009.01.003"},{"key":"295_CR12","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"},{"issue":"2\u20133","key":"295_CR13","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s10589-005-3060-5","volume":"33","author":"EA Y\u0131ld\u0131r\u0131m","year":"2006","unstructured":"Y\u0131ld\u0131r\u0131m EA, Fan-Orzechowski X (2006) On extracting maximum stable sets in perfect graphs using Lov\u00e1sz\u2019s theta function. Comput Optim Appl 33(2\u20133): 229\u2013247","journal-title":"Comput Optim Appl"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-009-0295-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00186-009-0295-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-009-0295-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T14:33:28Z","timestamp":1558622008000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00186-009-0295-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11,24]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,4]]}},"alternative-id":["295"],"URL":"https:\/\/doi.org\/10.1007\/s00186-009-0295-4","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,11,24]]}}}