András Hajnal

26 papers A* 2Journal 23
YearRankTypeTitle / Venue / Authors
2013 — ch.
Paul Erdős' Set Theory.
The Mathematics of Paul Erdős II
András Hajnal
2007 J jnl
In memory of László Kalmár.
Acta Cybern.
András Hajnal
2003 J jnl
Some Remarks on the Simultaneous Chromatic Number.
Comb.
András Hajnal, Péter Komjáth
2001 J jnl
Polarized Partition Relations.
J. Symb. Log.
James E. Baumgartner, András Hajnal
1997 J jnl
A Strongly Non-Ramsey Order Type.
Comb.
András Hajnal, Péter Komjáth
1996 J jnl
Preface.
Discret. Math.
András Hajnal, Gyula O. H. Katona, Attila Sali
1994 J jnl
Turán-Ramsey Theorems and K
Comb. Probab. Comput.
Paul Erdös, András Hajnal, Miklós Simonovits, Vera T. Sós, Endre Szemerédi
1993 J jnl
Cut-sets in infinite graphs and partial orders.
Discret. Math.
András Hajnal, Norbert Sauer
1993 J jnl
Threshold Circuits of Bounded Depth.
J. Comput. Syst. Sci.
András Hajnal, Wolfgang Maass, Pavel Pudlák, Mario Szegedy, György Turán
1993 J jnl
Turán-Ramsey theorems and simple asymptotically extremal structures.
Comb.
Paul Erdös, András Hajnal, Miklós Simonovits, Vera T. Sós, Endre Szemerédi
1992 J jnl
On the cardinality of certain Hausdorff spaces.
Discret. Math.
János Gerlits, András Hajnal, Zoltán Szentmiklóssy
1991 J jnl
Local constraints ensuring small representing sets.
J. Comb. Theory A
Paul Erdös, András Hajnal, Zsolt Tuza
1991 J jnl
Ramsey graphs contain many distinct induced subgraphs.
Graphs Comb.
Noga Alon, András Hajnal
1989 J jnl
On the number of distinct induced subgraphs of a graph.
Discret. Math.
Paul Erdös, András Hajnal
1989 J jnl
Ramsey-type theorems.
Discret. Appl. Math.
Paul Erdös, András Hajnal
1988 A* conf
On the Communication Complexity of Graph Properties
STOC
András Hajnal, Wolfgang Maass, György Turán
1987 J jnl
Some higher-gap examples in combinatorial set theory.
Ann. Pure Appl. Log.
András Hajnal, Péter Komjáth
1987 A* conf
Threshold circuits of bounded depth
FOCS
András Hajnal, Wolfgang Maass, Pavel Pudlák, Mario Szegedy, György Turán
1986 J jnl
Coloring graphs with locally few colors.
Discret. Math.
Paul Erdös, Zoltán Füredi, András Hajnal, Péter Komjáth, Vojtech Rödl, Ákos Seress
1986 J jnl
Complete subgraphs of infinite multipartite graphs and antichains in partially ordered sets.
Discret. Math.
András Hajnal, Norbert Sauer
1985 J jnl
Chromatic number of finite and infinite graphs and hypergraphs.
Discret. Math.
Paul Erdös, András Hajnal
1985 J jnl
The chromatic number of the product of two Alef
Comb.
András Hajnal
1984 J jnl
What must and what need not be contained in a graph of uncountable chromatic number?.
Comb.
András Hajnal, Péter Komjáth
1983 J jnl
More results on Ramsey - Turán Type problems.
Comb.
Paul Erdös, András Hajnal, Vera T. Sós, Endre Szemerédi
1983 J jnl
Paul Erdös is seventy.
J. Graph Theory
András Hajnal, Vera T. Sós
1973 J jnl
A Generalization of the Erdös-Ko-Rado Theorem on Finite Set Systems.
J. Comb. Theory A
András Hajnal, Bruce Rothschild