András Hajnal

Publication Activity (10 Years)

Years Active: 1973-2007
Publications (10 Years): 0

Publications

András Hajnal
In memory of László Kalmár. Acta Cybern. 18 (1) (2007)
András Hajnal, Péter Komjáth
Some Remarks on the Simultaneous Chromatic Number. Comb. 23 (1) (2003)
James E. Baumgartner, András Hajnal
Polarized Partition Relations. J. Symb. Log. 66 (2) (2001)
András Hajnal, Péter Komjáth
A Strongly Non-Ramsey Order Type. Comb. 17 (3) (1997)
András Hajnal, Gyula O. H. Katona, Attila Sali
Preface. Discret. Math. 150 (1-3) (1996)
Paul Erdös, András Hajnal, Miklós Simonovits, Vera T. Sós, Endre Szemerédi
-Independence Numbers. Comb. Probab. Comput. 3 (1994)
András Hajnal, Norbert Sauer
Cut-sets in infinite graphs and partial orders. Discret. Math. 117 (1-3) (1993)
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) (1993)
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. Comb. 13 (1) (1993)
János Gerlits, András Hajnal, Zoltán Szentmiklóssy
On the cardinality of certain Hausdorff spaces. Discret. Math. 108 (1-3) (1992)
Noga Alon, András Hajnal
Ramsey graphs contain many distinct induced subgraphs. Graphs Comb. 7 (1) (1991)
Paul Erdös, András Hajnal, Zsolt Tuza
Local constraints ensuring small representing sets. J. Comb. Theory, Ser. A 58 (1) (1991)
Paul Erdös, András Hajnal
Ramsey-type theorems. Discret. Appl. Math. 25 (1-2) (1989)
Paul Erdös, András Hajnal
On the number of distinct induced subgraphs of a graph. Discret. Math. 75 (1-3) (1989)
András Hajnal, Wolfgang Maass, György Turán
On the Communication Complexity of Graph Properties STOC (1988)
András Hajnal, Wolfgang Maass, Pavel Pudlák, Mario Szegedy, György Turán
Threshold circuits of bounded depth FOCS (1987)
András Hajnal, Péter Komjáth
Some higher-gap examples in combinatorial set theory. Ann. Pure Appl. Log. 33 (1987)
András Hajnal, Norbert Sauer
Complete subgraphs of infinite multipartite graphs and antichains in partially ordered sets. Discret. Math. 59 (1-2) (1986)
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. Discret. Math. 59 (1-2) (1986)
Paul Erdös, András Hajnal
Chromatic number of finite and infinite graphs and hypergraphs. Discret. Math. 53 (1985)
András Hajnal
- Chromatic Graphs can be countable. Comb. 5 (2) (1985)
András Hajnal, Péter Komjáth
What must and what need not be contained in a graph of uncountable chromatic number?. Comb. 4 (1) (1984)
András Hajnal, Vera T. Sós
Paul Erdös is seventy. J. Graph Theory 7 (4) (1983)
Paul Erdös, András Hajnal, Vera T. Sós, Endre Szemerédi
More results on Ramsey - Turán Type problems. Comb. 3 (1) (1983)
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) (1973)