{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T07:50:32Z","timestamp":1771573832610,"version":"3.50.1"},"reference-count":24,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7137,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1994,1]]},"DOI":"10.1016\/0012-365x(92)00057-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:34Z","timestamp":1027655014000},"page":"137-153","source":"Crossref","is-referenced-by-count":73,"title":["Stable sets and polynomials"],"prefix":"10.1016","volume":"124","author":[{"given":"L.","family":"Lov\u00e1sz","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(92)00057-X_BIB1","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF01204715","article-title":"Colorings and orientations of graphs","volume":"12","author":"Alon","year":"1992","journal-title":"Combinatorica"},{"key":"10.1016\/0012-365X(92)00057-X_BIB2","series-title":"Int. Symp. on Theory of Graphs, Rome","first-page":"9","article-title":"On critical graphs","author":"Andr\u00e1sfai","year":"1966"},{"key":"10.1016\/0012-365X(92)00057-X_BIB3","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF02125345","article-title":"The perfect matchable subgraph polytope of an arbitrary graph","volume":"9","author":"Balas","year":"1989","journal-title":"Combinatorica"},{"key":"10.1016\/0012-365X(92)00057-X_BIB4","series-title":"Res. Report 87464-OR","article-title":"Compositions of graphs and polyhedra II: stable sets","author":"Barahona","year":"1987"},{"key":"10.1016\/0012-365X(92)00057-X_BIB5","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/0012-365X(92)00057-X_BIB6","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/0095-8956(75)90041-6","article-title":"On certain polytopes associated with graphs","volume":"13","author":"Chv\u00e1tal","year":"1975","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(92)00057-X_BIB7","first-page":"181","article-title":"On the minimal number of vertices representing the edges of a graph","volume":"6","author":"Erdo&#x030B;s","year":"1961","journal-title":"MTA Mat. Kut. Int. K\u00f6zl."},{"key":"10.1016\/0012-365X(92)00057-X_BIB8","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.2307\/2311408","article-title":"A problem in graph theory","volume":"71","author":"Erdo&#x030B;s","year":"1964","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0012-365X(92)00057-X_BIB9","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1016\/0095-8956(86)90087-0","article-title":"Relaxations of vertex packing","volume":"40","author":"Gr\u00f6tschel","year":"1986","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(92)00057-X_BIB10","series-title":"Geometric Algorithms and Combinatorial Optimization","author":"Gr\u00f6tschel","year":"1988"},{"key":"10.1016\/0012-365X(92)00057-X_BIB11","doi-asserted-by":"crossref","first-page":"720","DOI":"10.4153\/CJM-1965-072-1","article-title":"A theorem on k-saturated graphs","volume":"17","author":"Hajnal","year":"1965","journal-title":"Canad. J. Math."},{"key":"10.1016\/0012-365X(92)00057-X_BIB12","series-title":"Theorie der endlichen und unendlichen Graphen","author":"K\u00f6nig","year":"1936"},{"key":"10.1016\/0012-365X(92)00057-X_BIB13","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/BF02579177","article-title":"Independence numbers of graphs and generators of ideals","volume":"1","author":"Li","year":"1981","journal-title":"Combinatorica"},{"key":"10.1016\/0012-365X(92)00057-X_BIB14","series-title":"Thesis","article-title":"Extended formulations and polyhedral projection","author":"Liu","year":"1988"},{"key":"10.1016\/0012-365X(92)00057-X_BIB15","series-title":"Proc. 6th British Comb. Conf.","first-page":"45","article-title":"Flats in matroids and geometric graphs, in: Combinatorial Surveys","author":"Lov\u00e1sz","year":"1977"},{"key":"10.1016\/0012-365X(92)00057-X_BIB16","first-page":"717","article-title":"Some finite basis theorems in graph theory, in: Combinatorics","volume":"Vol. 18","author":"Lov\u00e1sz","year":"1978","journal-title":"Coll. Math. Soc. J. Bolyai"},{"key":"10.1016\/0012-365X(92)00057-X_BIB17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","article-title":"On the Shannon capacity of graphs","volume":"25","author":"Lov\u00e1sz","year":"1979","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0012-365X(92)00057-X_BIB18","series-title":"Matching Theory","author":"Lov\u00e1sz","year":"1986"},{"key":"10.1016\/0012-365X(92)00057-X_BIB19","doi-asserted-by":"crossref","unstructured":"L. Lov\u00e1sz and A. Schrijver, Matrix cones, projection representations, and stable set polyhedra, in: Polyhedral Combinatorics, DIMACS Series in Discrete Math. and Theor. Comp. Sci. I: 1\u201317.","DOI":"10.1090\/dimacs\/001\/01"},{"key":"10.1016\/0012-365X(92)00057-X_BIB20","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1137\/0801013","article-title":"Cones of matrices and setfunctions, and 0\u20131 optimization (A. Schrijver)","volume":"1","author":"Lov\u00e1sz","year":"1990","journal-title":"SIAM J. Optim."},{"key":"10.1016\/0012-365X(92)00057-X_BIB21","doi-asserted-by":"crossref","first-page":"533","DOI":"10.4153\/CJM-1965-053-6","article-title":"Maxima for graphs and a new proof of a theorem of Tur\u00e1n","volume":"17","author":"Motzkin","year":"1965","journal-title":"Canad. J. Math."},{"key":"10.1016\/0012-365X(92)00057-X_BIB22","series-title":"Res. Report 90-11","article-title":"Stability critical graphs and the stable set polytope","author":"Sewell","year":"1990"},{"key":"10.1016\/0012-365X(92)00057-X_BIB23","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/0403036","article-title":"A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems","volume":"3","author":"Sherali","year":"1990","journal-title":"Siam J. Discrete Math."},{"key":"10.1016\/0012-365X(92)00057-X_BIB24","series-title":"Combinatorics and Commutative Algebra","author":"Stanley","year":"1983"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9200057X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9200057X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:57:37Z","timestamp":1555135057000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9200057X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,1]]},"references-count":24,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1994,1]]}},"alternative-id":["0012365X9200057X"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(92)00057-x","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,1]]}}}