Halevi, Yatir; Kaplan, Itay; Shelah, Saharon Infinite stable graphs with large chromatic number. (English) Zbl 07479585 Trans. Am. Math. Soc. 375, No. 3, 1767-1799 (2022). MSC: 03C45 05C15 PDFBibTeX XMLCite \textit{Y. Halevi} et al., Trans. Am. Math. Soc. 375, No. 3, 1767--1799 (2022; Zbl 07479585) Full Text: DOI arXiv
Thomassen, Carsten Infinitely connected subgraphs in graphs of uncountable chromatic number. (English) Zbl 1413.05124 Combinatorica 37, No. 4, 785-793 (2017). MSC: 05C15 05C40 05C63 05C30 PDFBibTeX XMLCite \textit{C. Thomassen}, Combinatorica 37, No. 4, 785--793 (2017; Zbl 1413.05124) Full Text: DOI Link
Schmerl, James H. Semialgebraic graphs having countable list-chromatic numbers. (English) Zbl 1331.05085 Proc. Am. Math. Soc. 144, No. 4, 1429-1438 (2016). MSC: 05C15 05C12 05C63 PDFBibTeX XMLCite \textit{J. H. Schmerl}, Proc. Am. Math. Soc. 144, No. 4, 1429--1438 (2016; Zbl 1331.05085) Full Text: DOI arXiv
Soukup, Dániel T. Trees, ladders and graphs. (English) Zbl 1319.05041 J. Comb. Theory, Ser. B 115, 96-116 (2015). MSC: 05C05 05C15 PDFBibTeX XMLCite \textit{D. T. Soukup}, J. Comb. Theory, Ser. B 115, 96--116 (2015; Zbl 1319.05041) Full Text: DOI arXiv
Komjáth, Péter The chromatic number of infinite graphs - A survey. (English) Zbl 1223.05199 Discrete Math. 311, No. 15, 1448-1450 (2011). MSC: 05C63 05C15 05-02 PDFBibTeX XMLCite \textit{P. Komjáth}, Discrete Math. 311, No. 15, 1448--1450 (2011; Zbl 1223.05199) Full Text: DOI
Komjáth, P.; Shelah, S. On Taylor’s problem. (English) Zbl 0844.05043 Acta Math. Hung. 70, No. 3, 217-225 (1996). Reviewer: A.T.White (Kalamazoo) MSC: 05C15 PDFBibTeX XMLCite \textit{P. Komjáth} and \textit{S. Shelah}, Acta Math. Hung. 70, No. 3, 217--225 (1996; Zbl 0844.05043) Full Text: DOI arXiv
Erdős, Paul Some of my favorite solved and unsolved problems in graph theory. (English) Zbl 0794.05054 Quaest. Math. 16, No. 3, 333-350 (1993). Reviewer: I.Tomescu (Bucureşti) MSC: 05C35 00A07 05C15 05C55 05C38 PDFBibTeX XMLCite \textit{P. Erdős}, Quaest. Math. 16, No. 3, 333--350 (1993; Zbl 0794.05054) Full Text: DOI
Komjáth, Péter; Shelah, Saharon Forcing constructions for uncountably chromatic graphs. (English) Zbl 0657.03029 J. Symb. Log. 53, No. 3, 696-707 (1988). Reviewer: K.P.Hart MSC: 03E05 03E35 05C15 PDFBibTeX XMLCite \textit{P. Komjáth} and \textit{S. Shelah}, J. Symb. Log. 53, No. 3, 696--707 (1988; Zbl 0657.03029) Full Text: DOI
Erdős, Paul; Hajnal, András Chromatic number of finite and infinite graphs and hypergraphs. (English) Zbl 0566.05029 Discrete Math. 53, 281-285 (1985). Reviewer: I.Tomescu MSC: 05C15 05C35 05-02 PDFBibTeX XMLCite \textit{P. Erdős} and \textit{A. Hajnal}, Discrete Math. 53, 281--285 (1985; Zbl 0566.05029) Full Text: DOI