{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T14:26:48Z","timestamp":1764858408001},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1983,3,1]],"date-time":"1983-03-01T00:00:00Z","timestamp":415324800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1983,3]]},"DOI":"10.1007\/bf02579349","type":"journal-article","created":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T22:17:58Z","timestamp":1174601878000},"page":"133-134","source":"Crossref","is-referenced-by-count":8,"title":["Cycles in graphs of uncountable chromatic number"],"prefix":"10.1007","volume":"3","author":[{"given":"C.","family":"Thomassen","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02579349_CR1","unstructured":"P. Erd\u0151s, Problems and results on finite and infinite graphs, in:Recent Advances in Graph Theory (ed. M. Fiedler), Academia Prague (1975), 249\u2013256."},{"key":"BF02579349_CR2","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF02579174","volume":"1","author":"P. Erd\u0151s","year":"1981","unstructured":"P. Erd\u0151s, On the combinatorical problems which I would most like to see solved,Combinatorica 1 (1981), 25\u201342.","journal-title":"Combinatorica"},{"key":"BF02579349_CR3","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1307\/mmj\/1028999083","volume":"11","author":"P. Erd\u0151s","year":"1964","unstructured":"P. Erd\u0151s andA. Hajnal, Some remarks in set theory IX,Michigan Math. J. 11 (1964), 107\u2013127.","journal-title":"Michigan Math. J."},{"key":"BF02579349_CR4","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BF02020444","volume":"17","author":"P. Erd\u0151s","year":"1966","unstructured":"P. Erd\u0151s andA. Hajnal, On chromatic number of graphs and set systems,Acta Math. Acad. Sci. Hung. 17 (1966), 61\u201399.","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"BF02579349_CR5","unstructured":"P. Erd\u0151s, A. Hajnal andS. Shelah, On some general properties of chromatic numbers,Coll. Math. Soc. J. Bolyai 8,Topics in Topology, North Holland (1972), 243\u2013255."},{"key":"BF02579349_CR6","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1112\/jlms\/s1-35.4.445","volume":"35","author":"P. Erd\u0151s","year":"1960","unstructured":"P. Erd\u0151s andR. Rado, A construction of graphs without triangles having preassigned order and chromatic number,J. London Math. Soc. 35 (1960), 445\u2013448.","journal-title":"J. London Math. Soc."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579349.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02579349\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579349","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T16:45:02Z","timestamp":1558197902000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02579349"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,3]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1983,3]]}},"alternative-id":["BF02579349"],"URL":"https:\/\/doi.org\/10.1007\/bf02579349","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1983,3]]}}}