András Hajnal

2003
20	EE	András Hajnal, Péter Komjáth: Some Remarks on the Simultaneous Chromatic Number. Combinatorica 23(1): 89-104 (2003)
2001
19		James E. Baumgartner, András Hajnal: Polarized Partition Relations. J. Symb. Log. 66(2): 811-821 (2001)
1996
18	EE	András Hajnal, Gyula O. H. Katona, Attila Sali: Preface. Discrete Mathematics 150(1-3): 1 (1996)
1994
17		Paul Erdös, András Hajnal, Miklós Simonovits, Vera T. Sós, Endre Szemerédi: Turán-Ramsey Theorems and Kp-Independence Numbers. Combinatorics, Probability & Computing 3: 297-325 (1994)
1993
16		Paul Erdös, András Hajnal, Miklós Simonovits, Vera T. Sós, Endre Szemerédi: Turán-Ramsey theorems and simple asymptotically extremal structures. Combinatorica 13(1): 31-56 (1993)
15	EE	András Hajnal, N. Sauer: Cut-sets in infinite graphs and partial orders. Discrete Mathematics 117(1-3): 113-125 (1993)
14		András Hajnal, Wolfgang Maass, Pavel Pudlák, Mario Szegedy, György Turán: Threshold Circuits of Bounded Depth. J. Comput. Syst. Sci. 46(2): 129-154 (1993)
1992
13	EE	János Gerlits, András Hajnal, Z. Szentmiklóssy: On the cardinality of certain Hausdorff spaces. Discrete Mathematics 108(1-3): 31-35 (1992)
1991
12	EE	Paul Erdös, András Hajnal, Zsolt Tuza: Local constraints ensuring small representing sets. J. Comb. Theory, Ser. A 58(1): 78-84 (1991)
1989
11	EE	Paul Erdös, András Hajnal: Ramsey-type theorems. Discrete Applied Mathematics 25(1-2): 37-52 (1989)
10	EE	Paul Erdös, András Hajnal: On the number of distinct induced subgraphs of a graph. Discrete Mathematics 75(1-3): 145-154 (1989)
1988
9		András Hajnal, Wolfgang Maass, György Turán: On the Communication Complexity of Graph Properties STOC 1988: 186-191
1987
8		András Hajnal, Wolfgang Maass, Pavel Pudlák, Mario Szegedy, György Turán: Threshold circuits of bounded depth FOCS 1987: 99-110
1986
7	EE	Paul Erdös, Zoltán Füredi, András Hajnal, Péter Komjáth, Vojtech Rödl, Ákos Seress: Coloring graphs with locally few colors. Discrete Mathematics 59(1-2): 21-34 (1986)
6	EE	András Hajnal, N. Sauer: Complete subgraphs of infinite multipartite graphs and antichains in partially ordered sets. Discrete Mathematics 59(1-2): 61-67 (1986)
1985
5		András Hajnal: The chromatic number of the product of two Alef i - Chromatic Graphs can be countable. Combinatorica 5(2): 137-139 (1985)
4	EE	Paul Erdös, András Hajnal: Chromatic number of finite and infinite graphs and hypergraphs. Discrete Mathematics 53: 281-285 (1985)
1984
3		András Hajnal, Péter Komjáth: What must and what need not be contained in a graph of uncountable chromatic number?. Combinatorica 4(1): 47-52 (1984)
1983
2		Paul Erdös, András Hajnal, Vera T. Sós, Endre Szemerédi: More results on Ramsey - Turán Type problems. Combinatorica 3(1): 69-81 (1983)
1973
1		András Hajnal, Bruce Rothschild: A Generalization of the Erdös-Ko-Rado Theorem on Finite Set Systems. J. Comb. Theory, Ser. A 15(3): 359-362 (1973)

Coauthor Index

1	James E. Baumgartner	[19]
2	Paul Erdös	[2] [4] [7] [10] [11] [12] [16] [17]
3	Zoltán Füredi	[7]
4	János Gerlits	[13]
5	Gyula O. H. Katona	[18]
6	Péter Komjáth	[3] [7] [20]
7	Wolfgang Maass	[8] [9] [14]
8	Pavel Pudlák	[8] [14]
9	Vojtech Rödl	[7]
10	Bruce Rothschild (B. L. Rothschild)	[1]
11	Attila Sali	[18]
12	N. Sauer	[6] [15]
13	Ákos Seress	[7]
14	Miklós Simonovits	[16] [17]
15	Vera T. Sós	[2] [16] [17]
16	Mario Szegedy	[8] [14]
17	Endre Szemerédi	[2] [16] [17]
18	Z. Szentmiklóssy	[13]
19	György Turán	[8] [9] [14]
20	Zsolt Tuza	[12]

Colors in the list of coauthors