Hajnal, A.; Komjáth, P. Some remarks on the simultaneous chromatic number. (English) Zbl 1048.03039 Combinatorica 23, No. 1, 89-104 (2003). Reviewer: András Pluhár (Szeged) MSC: 03E35 05C15 PDFBibTeX XMLCite \textit{A. Hajnal} and \textit{P. Komjáth}, Combinatorica 23, No. 1, 89--104 (2003; Zbl 1048.03039) Full Text: DOI
Hajnal, András; Komjáth, Péter A strongly non-Ramsey order type. (English) Zbl 0902.03032 Combinatorica 17, No. 3, 363-367 (1997). Reviewer: Pierre Matet (Caen) MSC: 03E05 03E35 PDFBibTeX XMLCite \textit{A. Hajnal} and \textit{P. Komjáth}, Combinatorica 17, No. 3, 363--367 (1997; Zbl 0902.03032) Full Text: DOI
Erdős, Paul; Hajnal, András; Simonovits, Miklós.; Sós, V. T.; Szemerédi, E. Turán-Ramsey theorems and simple asymptotically extremal structures. (English) Zbl 0774.05050 Combinatorica 13, No. 1, 31-56 (1993). Reviewer: W.G.Brown (Montreal) MSC: 05C35 05C55 05C38 PDFBibTeX XMLCite \textit{P. Erdős} et al., Combinatorica 13, No. 1, 31--56 (1993; Zbl 0774.05050) Full Text: DOI
Hajnal, András The chromatic number of the product of two \(\aleph _ 1\)-chromatic graphs can be countable. (English) Zbl 0575.05029 Combinatorica 5, 137-139 (1985). Reviewer: J.G.Oxley MSC: 05C15 PDFBibTeX XMLCite \textit{A. Hajnal}, Combinatorica 5, 137--139 (1985; Zbl 0575.05029) Full Text: DOI
Hajnal, András; Komjáth, Péter What must and what need not be contained in a graph of uncountable chromatic number? (English) Zbl 0541.05026 Combinatorica 4, 47-52 (1984). Reviewer: N.H.Williams MSC: 05C15 03E05 PDFBibTeX XMLCite \textit{A. Hajnal} and \textit{P. Komjáth}, Combinatorica 4, 47--52 (1984; Zbl 0541.05026) Full Text: DOI
Erdős, Paul; Hajnal, András; Sós, Vera T.; Szemeredi, E. More results on Ramsey-Turán type problems. (English) Zbl 0526.05031 Combinatorica 3, 69-81 (1983). Reviewer: L.Lesniak MSC: 05C35 05C55 05C05 PDFBibTeX XMLCite \textit{P. Erdős} et al., Combinatorica 3, 69--81 (1983; Zbl 0526.05031) Full Text: DOI