{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T23:43:03Z","timestamp":1764373383101},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1984,3,1]],"date-time":"1984-03-01T00:00:00Z","timestamp":446947200000},"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":[[1984,3]]},"DOI":"10.1007\/bf02579156","type":"journal-article","created":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T21:16:21Z","timestamp":1174598181000},"page":"47-52","source":"Crossref","is-referenced-by-count":15,"title":["What must and what need not be contained in a graph of uncountable chromatic number?"],"prefix":"10.1007","volume":"4","author":[{"given":"Andr\u00e1s","family":"Hajnal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P\u00e9ter","family":"Komj\u00e1th","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02579156_CR1","doi-asserted-by":"crossref","first-page":"34","DOI":"10.4153\/CJM-1959-003-9","volume":"11","author":"P. Erd\u0151s","year":"1959","unstructured":"P. Erd\u0151s, Graph theory and probability,Canad. J. Math. 11 (1959), 34\u201338.","journal-title":"Canad. J. Math."},{"key":"BF02579156_CR2","first-page":"425","volume-title":"Coll. Math. Soc. J\u00e1nos Bolyai 10,Infinite and Finite Sets","author":"P. Erd\u0151s","year":"1973","unstructured":"P. Erd\u0151s, F. Galvin andA. Hajnal, On set systems having large chromatic numbers and not containing prescribed subsystems,Coll. Math. Soc. J\u00e1nos Bolyai 10,Infinite and Finite Sets, Keszthely (Hungary) 1973, 425\u2013513."},{"key":"BF02579156_CR3","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":"BF02579156_CR4","first-page":"243","volume-title":"Coll. Math. Soc. J\u00e1nos Bolyai 8,Topics in Topology","author":"P. Erd\u0151s","year":"1973","unstructured":"P. Erd\u0151s, A. Hajnal andS. Shelah, On some general properties of chromatic numbers,Coll. Math. Soc. J\u00e1nos Bolyai 8,Topics in Topology, Keszthely, (Hungary) 1973, 243\u2013255."},{"key":"BF02579156_CR5","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 pre-assigned order and chromatic number,Journal of the London Math. Soc. 35 (1960), 445\u2013448.","journal-title":"Journal of the London Math. Soc."},{"key":"BF02579156_CR6","unstructured":"A. Hajnal andA. M\u00e1t\u00e9, Set mappings, partitions and chromatic numbers,Proceedings of Bristol Logic Conference, July 1973, 67\u201369."},{"key":"BF02579156_CR7","first-page":"275","volume":"15","author":"P. Komj\u00e1th","year":"1981","unstructured":"P. Komj\u00e1th, A note on Hajnal\u2014M\u00e1t\u00e9 graphs,Studia Sci. Math. Hung. 15 (1981), 275\u2013278.","journal-title":"Studia Sci. Math. Hung."},{"key":"BF02579156_CR8","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF01894680","volume":"19","author":"L. Lov\u00e1sz","year":"1969","unstructured":"L. Lov\u00e1sz, On chromatic number of graphs and set-systems,Acta Math. Acad. Sci. Hung. 19 (1969), 59\u201367.","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"BF02579156_CR9","doi-asserted-by":"crossref","first-page":"161","DOI":"10.4064\/cm-3-2-161-162","volume":"3","author":"J. Mycielski","year":"1955","unstructured":"J. Mycielski, Sur le coloriage des graphs,Colloq. Math. 3 (1955), 161\u2013162.","journal-title":"Colloq. Math."},{"key":"BF02579156_CR10","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF02579349","volume":"3","author":"C. Thomassen","year":"1983","unstructured":"C. Thomassen, Cycles in graphs of uncountable chromatic number,Combinatorica 3 (1983), 133\u2013134.","journal-title":"Combinatorica"},{"issue":"66","key":"BF02579156_CR11","first-page":"163","volume":"24","author":"A. A. Zykov","year":"1949","unstructured":"A. A. Zykov, On some properties of linear complexes,Russian Math. Sbornik, N. S. 24 (66) (1949), 163\u2013188.","journal-title":"Russian Math. Sbornik, N. S."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579156.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02579156\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579156","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T16:44:58Z","timestamp":1558197898000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02579156"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,3]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1984,3]]}},"alternative-id":["BF02579156"],"URL":"https:\/\/doi.org\/10.1007\/bf02579156","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1984,3]]}}}