András Hajnal

	2007
22		András Hajnal: In memory of László Kalmár. Acta Cybern. 18(1): 7-8 (2007)
	2003
21		András Hajnal, Péter Komjáth: Some Remarks on the Simultaneous Chromatic Number. Combinatorica 23(1): 89-104 (2003)
	2001
20		James E. Baumgartner, András Hajnal: Polarized Partition Relations. J. Symb. Log. 66(2): 811-821 (2001)
	1996
19		András Hajnal, Gyula O. H. Katona, Attila Sali: Preface. Discrete Mathematics 150(1-3): 1 (1996)
	1994
18		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
17		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)
16		András Hajnal, N. Sauer: Cut-sets in infinite graphs and partial orders. Discrete Mathematics 117(1-3): 113-125 (1993)
15		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
14		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
13		Noga Alon, András Hajnal: Ramsey graphs contain many distinct induced subgraphs. Graphs and Combinatorics 7(1): 1-6 (1991)
12		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		Paul Erdös, András Hajnal: Ramsey-type theorems. Discrete Applied Mathematics 25(1-2): 37-52 (1989)
10		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		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		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		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	Noga Alon	[13]
2	James E. Baumgartner	[20]
3	Paul Erdös	[2] [4] [7] [10] [11] [12] [17] [18]
4	Zoltán Füredi	[7]
5	János Gerlits	[14]
6	Gyula O. H. Katona	[19]
7	Péter Komjáth	[3] [7] [21]
8	Wolfgang Maass	[8] [9] [15]
9	Pavel Pudlák	[8] [15]
10	Vojtech Rödl	[7]
11	Bruce Rothschild (B. L. Rothschild)	[1]
12	Attila Sali	[19]
13	N. Sauer	[6] [16]
14	Ákos Seress	[7]
15	Miklós Simonovits	[17] [18]
16	Vera T. Sós	[2] [17] [18]
17	Mario Szegedy	[8] [15]
18	Endre Szemerédi	[2] [17] [18]
19	Z. Szentmiklóssy	[14]
20	György Turán	[8] [9] [15]
21	Zsolt Tuza	[12]

Colors in the list of coauthors

Last update Fri Jun 1 15:44:53 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page