{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T06:43:37Z","timestamp":1776149017674,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,8,5]],"date-time":"2014-08-05T00:00:00Z","timestamp":1407196800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1007\/s00493-014-3074-7","type":"journal-article","created":{"date-parts":[[2014,8,5]],"date-time":"2014-08-05T03:44:32Z","timestamp":1407210272000},"page":"215-233","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Chromatic numbers of graphs \u2014 large gaps"],"prefix":"10.1007","volume":"35","author":[{"given":"Assaf","family":"Rinot","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,8,5]]},"reference":[{"key":"3074_CR1","doi-asserted-by":"crossref","first-page":"234","DOI":"10.2307\/2274106","volume":"49","author":"J. E. Baumgartner","year":"1984","unstructured":"James E. Baumgartner: Generic graph construction, J. Symbolic Logic 49 (1984), 234\u2013240.","journal-title":"J. Symbolic Logic"},{"key":"3074_CR2","first-page":"369","volume":"13","author":"N. G. Bruijn de","year":"1951","unstructured":"N. G. de Bruijn and P. Erdos: A colour problem for infinite graphs and a problem in the theory of relations, Nederl. Akad. Wetensch. Proc. Ser. A. 54; Indagationes Math. 13 (1951), 369\u2013373.","journal-title":"Nederl. Akad. Wetensch. Proc. Ser. A. 54; Indagationes Math."},{"key":"3074_CR3","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BF02020444","volume":"17","author":"P. Erdos","year":"1966","unstructured":"P. Erdos and A. Hajnal: On chromatic number of graphs and set-systems, Acta Math. Acad. Sci. Hungar 17 (1966), 61\u201399.","journal-title":"Acta Math. Acad. Sci. Hungar"},{"key":"3074_CR4","first-page":"83","volume-title":"Theory of Graphs (Proc. Colloq., Tihany, 1966)","author":"P. Erdos","year":"1968","unstructured":"P. Erdos and A. Hajnal: On chromatic number of infinite graphs, in: Theory of Graphs (Proc. Colloq., Tihany, 1966), 83\u201398. Academic Press, New York, 1968."},{"key":"3074_CR5","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1016\/0001-8708(88)90041-2","volume":"67","author":"M. Foreman","year":"1988","unstructured":"M. Foreman and Richard Laver: Some downwards transfer properties for \u21352, Adv. in Math. 67 (1988), 230\u2013238.","journal-title":"Adv. in Math."},{"key":"3074_CR6","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF02276099","volume":"4","author":"F. Galvin","year":"1973","unstructured":"F. Galvin: Chromatic numbers of subgraphs, Period. Math. Hungar. 4 (1973), 117\u2013119.","journal-title":"Period. Math. Hungar."},{"key":"3074_CR7","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF02772573","volume":"61","author":"P. Komj\u00e1th","year":"1988","unstructured":"P. Komj\u00e1th: Consistency results on infinite graphs, Israel J. Math. 61 (1988), 285\u2013294.","journal-title":"Israel J. Math."},{"key":"3074_CR8","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1090\/dimacs\/058\/08","volume-title":"Set theory (Piscataway, NJ, 1999)","author":"P. Komj\u00e1th","year":"2002","unstructured":"P. Komj\u00e1th: Subgraph chromatic number, in: Set theory (Piscataway, NJ, 1999), vol. 58 of DIMACS Ser. Discrete Math. Theoret. Comput. Sci., 99\u2013106. Amer. Math. Soc., Providence, RI, 2002."},{"key":"3074_CR9","doi-asserted-by":"crossref","first-page":"1497","DOI":"10.1007\/978-1-4020-5764-9_19","volume-title":"Handbook of set theory. Vols. 1, 2, 3","author":"W. J. Mitchell","year":"2010","unstructured":"W. J. Mitchell: The covering lemma, in: Handbook of set theory. Vols. 1, 2, 3, 1497\u20131594. Springer, Dordrecht, 2010."},{"key":"3074_CR10","doi-asserted-by":"crossref","first-page":"975","DOI":"10.1007\/s11856-013-0065-0","volume":"199","author":"A. Rinot","year":"2014","unstructured":"A. Rinot: The Ostaszewski square, and homogeneous Souslin trees, Israel J. Math. 199 (2014), 975\u20131012.","journal-title":"Israel J. Math."},{"key":"3074_CR11","first-page":"125","volume-title":"Set theory and its applications","author":"A. Rinot","year":"2001","unstructured":"A. Rinot: Jensen\u2019s diamond principle and its relatives, in: Set theory and its applications, volume 533 of Contemp. Math., 125\u2013156. Amer. Math. Soc., Providence, RI, 2001."},{"key":"3074_CR12","doi-asserted-by":"crossref","unstructured":"S. Shelah: On incompactness for chromatic number of graphs, Acta Mathematica Hungarica, accepted.","DOI":"10.1007\/s10474-012-0287-3"},{"key":"3074_CR13","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1017\/CBO9780511983917.030","volume-title":"A tribute to Paul Erdos","author":"S. Shelah","year":"1990","unstructured":"S. Shelah: Incompactness for chromatic numbers of graphs, in: A tribute to Paul Erdos, 361\u2013371. Cambridge Univ. Press, Cambridge, 1990."},{"key":"3074_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01946375","volume":"21","author":"L. Soukup","year":"1990","unstructured":"L. Soukup: On c+-chromatic graphs with small bounded subgraphs, Period. Math. Hungar. 21 (1990), 1\u20137.","journal-title":"Period. Math. Hungar."},{"key":"3074_CR15","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/978-94-017-0487-8_8","volume-title":"Logic and scientific methods (Florence, 1995)","author":"S. Todor\u010devi\u0107","year":"1997","unstructured":"S. Todor\u010devi\u0107: Comparing the continuum with the first two uncountable cardinals, in: Logic and scientific methods (Florence, 1995), vol. 259 of Synthese Lib., 145\u2013155. Kluwer Acad. Publ., Dordrecht, 1997."},{"key":"3074_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2178\/bsl\/1294186662","volume":"17","author":"S. Todorcevic","year":"2011","unstructured":"S. Todorcevic: Combinatorial dichotomies in set theory, Bull. Symbolic Logic 17 (2011), 1\u201372.","journal-title":"Bull. Symbolic Logic"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-014-3074-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-014-3074-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-014-3074-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,13]],"date-time":"2019-08-13T11:22:19Z","timestamp":1565695339000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-014-3074-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,5]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["3074"],"URL":"https:\/\/doi.org\/10.1007\/s00493-014-3074-7","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,5]]}}}