András Hajnal

According to our database, András Hajnal authored at least 25 papers between 1973 and 2013.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of one.

2013

Paul Erdős' Set Theory.

András Hajnal

Proceedings of the Mathematics of Paul Erdős II, 2013

2007

In memory of László Kalmár.

András Hajnal

Acta Cybern., 2007

2003

Some Remarks on the Simultaneous Chromatic Number.

András Hajnal, Péter Komjáth

Comb., 2003

2001

Polarized Partition Relations.

James E. Baumgartner, András Hajnal

J. Symb. Log., 2001

1997

A Strongly Non-Ramsey Order Type.

András Hajnal, Péter Komjáth

Comb., 1997

1996

Preface.

András Hajnal, Gyula O. H. Katona, Attila Sali

Discret. Math., 1996

1994

Turán-Ramsey Theorems and K^p-Independence Numbers.

Paul Erdös, András Hajnal, Miklós Simonovits, Vera T. Sós, Endre Szemerédi

Comb. Probab. Comput., 1994

1993

Threshold Circuits of Bounded Depth.

András Hajnal, Wolfgang Maass, Pavel Pudlák, Mario Szegedy, György Turán

J. Comput. Syst. Sci., 1993

Cut-sets in infinite graphs and partial orders.

András Hajnal, Norbert Sauer

Discret. Math., 1993

Turán-Ramsey theorems and simple asymptotically extremal structures.

Paul Erdös, András Hajnal, Miklós Simonovits, Vera T. Sós, Endre Szemerédi

Comb., 1993

1992

On the cardinality of certain Hausdorff spaces.

János Gerlits, András Hajnal, Zoltán Szentmiklóssy

Discret. Math., 1992

1991

Local constraints ensuring small representing sets.

Paul Erdös, András Hajnal, Zsolt Tuza

J. Comb. Theory A, 1991

Ramsey graphs contain many distinct induced subgraphs.

Noga Alon, András Hajnal

Graphs Comb., 1991

1989

On the number of distinct induced subgraphs of a graph.

Paul Erdös, András Hajnal

Discret. Math., 1989

Ramsey-type theorems.

Paul Erdös, András Hajnal

Discret. Appl. Math., 1989

1988

On the Communication Complexity of Graph Properties

András Hajnal, Wolfgang Maass, György Turán

Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

1987

Some higher-gap examples in combinatorial set theory.

András Hajnal, Péter Komjáth

Ann. Pure Appl. Log., 1987

1986

Complete subgraphs of infinite multipartite graphs and antichains in partially ordered sets.

András Hajnal, Norbert Sauer

Discret. Math., 1986

Coloring graphs with locally few colors.

Paul Erdös, Zoltán Füredi, András Hajnal, Péter Komjáth, Vojtech Rödl, Ákos Seress

Discret. Math., 1986

1985

Chromatic number of finite and infinite graphs and hypergraphs.

Paul Erdös, András Hajnal

Discret. Math., 1985

The chromatic number of the product of two Alef _i - Chromatic Graphs can be countable.

András Hajnal

Comb., 1985

1984

What must and what need not be contained in a graph of uncountable chromatic number?.

András Hajnal, Péter Komjáth

Comb., 1984

1983

Paul Erdös is seventy.

András Hajnal, Vera T. Sós

J. Graph Theory, 1983

More results on Ramsey - Turán Type problems.

Paul Erdös, András Hajnal, Vera T. Sós, Endre Szemerédi

Comb., 1983

1973

A Generalization of the Erdös-Ko-Rado Theorem on Finite Set Systems.

András Hajnal, Bruce Rothschild

J. Comb. Theory A, 1973