Hajnal, A.; Komjáth, P. Obligatory subsystems of triple systems. (English) Zbl 1199.03029 Acta Math. Hung. 119, No. 1-2, 1-13 (2008). Reviewer: Aleksej Dmitrievich Korshunov (Novosibirsk) MSC: 03E05 03E35 05B07 05C15 05C65 PDFBibTeX XMLCite \textit{A. Hajnal} and \textit{P. Komjáth}, Acta Math. Hung. 119, No. 1--2, 1--13 (2008; Zbl 1199.03029) Full Text: DOI
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
Galvin, F.; Hajnal, A.; Komjáth, P. Edge decompositions of graphs with no large independent sets. (English) Zbl 0854.03046 Publ. Inst. Math., Nouv. Sér. 57(71), 71-80 (1995). MSC: 03E05 03E50 03E35 PDFBibTeX XMLCite \textit{F. Galvin} et al., Publ. Inst. Math., Nouv. Sér. 57(71), 71--80 (1995; Zbl 0854.03046) Full Text: EuDML EMIS
Hajnal, András; Komjáth, P. Corrigendum to “Embedding graphs into colored graphs”. (English) Zbl 0755.03023 Trans. Am. Math. Soc. 332, No. 1, 475 (1992). MSC: 03E05 05C15 03E35 05C55 PDFBibTeX XMLCite \textit{A. Hajnal} and \textit{P. Komjáth}, Trans. Am. Math. Soc. 332, No. 1, 475 (1992; Zbl 0755.03023) Full Text: DOI
Elekes, G.; Hajnal, András; Komjáth, P. Partition theorems for the power set. (English) Zbl 0785.05085 Halász, G. (ed.) et al., Sets, graphs and numbers. A birthday salute to Vera T. Sós and András Hajnal. Amsterdam: North-Holland Publishing Company. Colloq. Math. Soc. János Bolyai. 60, 211-217 (1992). MSC: 05D10 PDFBibTeX XMLCite \textit{G. Elekes} et al., in: Sets, graphs and numbers. A birthday salute to Vera T. Sós and András Hajnal. Amsterdam: North-Holland Publishing Company. 211--217 (1992; Zbl 0785.05085)
Hajnal, András; Komjáth, P.; Soukup, L.; Szalkai, I. Decompositions of edge colored infinite complete graphs. (English) Zbl 0697.05028 Combinatorics, Proc. 7th Hung. Colloq., Eger/Hung. 1987, Colloq. Math. Soc. János Bolyai 52, 277-280 (1988). Reviewer: K.Engel MSC: 05C15 03E05 05C40 PDFBibTeX XML
Hajnal, András; Komjáth, P. Embedding graphs into colored graphs. (English) Zbl 0659.03029 Trans. Am. Math. Soc. 307, No. 1, 395-409 (1988). Reviewer: N.H.Williams MSC: 03E05 03E35 05C15 05C55 PDFBibTeX XMLCite \textit{A. Hajnal} and \textit{P. Komjáth}, Trans. Am. Math. Soc. 307, No. 1, 395--409 (1988; Zbl 0659.03029) Full Text: DOI
Hajnal, András; Komjáth, P. Some higher-gap examples in combinatorial set theory. (English) Zbl 0646.03046 Ann. Pure Appl. Logic 33, 283-296 (1987). Reviewer: N.H.Williams MSC: 03E35 03E05 PDFBibTeX XMLCite \textit{A. Hajnal} and \textit{P. Komjáth}, Ann. Pure Appl. Logic 33, 283--296 (1987; Zbl 0646.03046) Full Text: DOI
Erdős, Paul; Füredi, Z.; Hajnal, András; Komjáth, P.; Rödl, Vojtěch; Seress, Á. Coloring graphs with locally few colors. (English) Zbl 0591.05030 Discrete Math. 59, 21-34 (1986). Reviewer: I.Tomescu MSC: 05C15 PDFBibTeX XMLCite \textit{P. Erdős} et al., Discrete Math. 59, 21--34 (1986; Zbl 0591.05030) 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