{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T17:48:25Z","timestamp":1775152105289,"version":"3.50.1"},"reference-count":6,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1978,11,1]],"date-time":"1978-11-01T00:00:00Z","timestamp":278726400000},"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":12677,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series A"],"published-print":{"date-parts":[[1978,11]]},"DOI":"10.1016\/0097-3165(78)90022-5","type":"journal-article","created":{"date-parts":[[2004,9,8]],"date-time":"2004-09-08T10:33:15Z","timestamp":1094639595000},"page":"319-324","source":"Crossref","is-referenced-by-count":482,"title":["Kneser's conjecture, chromatic number, and homotopy"],"prefix":"10.1016","volume":"25","author":[{"given":"L","family":"Lov\u00e1sz","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0097-3165(78)90022-5_BIB1","doi-asserted-by":"crossref","first-page":"177","DOI":"10.4064\/fm-20-1-177-190","article-title":"Drei S\u00e4tze \u00fcber die n-dimensionale euklidische sph\u00e4re","volume":"20","author":"Borsuk","year":"1933","journal-title":"Fund. Math."},{"key":"10.1016\/0097-3165(78)90022-5_BIB2","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BF02020444","article-title":"On chromatic number of graphs and set-systems","volume":"17","author":"Erd\u00f6s","year":"1966","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"10.1016\/0097-3165(78)90022-5_BIB3","first-page":"1","article-title":"Kromatikus gr\u00e1fokr\u00f3l","volume":"18","author":"Erd\u00f6s","year":"1967","journal-title":"Mat. Lapok"},{"key":"10.1016\/0097-3165(78)90022-5_BIB4","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/321921.321926","article-title":"The complexity of near-optimal graph coloring","volume":"23","author":"Garey","year":"1976","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0097-3165(78)90022-5_BIB5","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0095-8956(76)90010-1","article-title":"n-tuple colorings and associated graphs","volume":"20","author":"Stahl","year":"1976","journal-title":"J. Combinatorial Theory Ser. B"},{"key":"10.1016\/0097-3165(78)90022-5_BIB6","article-title":"Aufgabe 300","volume":"58","author":"Kneser","year":"1955","journal-title":"Jber. Deutsch. Math.-Verein."}],"container-title":["Journal of Combinatorial Theory, Series A"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097316578900225?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097316578900225?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T22:58:24Z","timestamp":1549234704000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0097316578900225"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978,11]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1978,11]]}},"alternative-id":["0097316578900225"],"URL":"https:\/\/doi.org\/10.1016\/0097-3165(78)90022-5","relation":{},"ISSN":["0097-3165"],"issn-type":[{"value":"0097-3165","type":"print"}],"subject":[],"published":{"date-parts":[[1978,11]]}}}