András Hajnal - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 24 from 24

2013

Paul Erdős' Set TheoryAndrás Hajnal. In Ronald L. Graham, Jaroslav Nesetril, Steve Butler, editors, The Mathematics of Paul Erdős II. pages 379-418, Springer, 2013. [doi]

2003

Some Remarks on the Simultaneous Chromatic NumberAndrás Hajnal, Péter Komjáth. combinatorica, 23(1):89-104, 2003. [doi]

2001

Polarized Partition RelationsJames E. Baumgartner, András Hajnal. JSYML, 66(2):811-821, 2001.

1996

PrefaceAndrás Hajnal, Gyula O. H. Katona, Attila Sali. DM, 150(1-3):1, 1996. [doi]

1994

Turán-Ramsey Theorems and K:::p:::-Independence NumbersPaul Erdös, András Hajnal, Miklós Simonovits, Vera T. Sós, Endre Szemerédi. cpc, 3:297-325, 1994.

1993

Turán-Ramsey theorems and simple asymptotically extremal structuresPaul Erdös, András Hajnal, Miklós Simonovits, Vera T. Sós, Endre Szemerédi. combinatorica, 13(1):31-56, 1993.

Cut-sets in infinite graphs and partial ordersAndrás Hajnal, N. Sauer. DM, 117(1-3):113-125, 1993. [doi]

Threshold Circuits of Bounded DepthAndrás Hajnal, Wolfgang Maass, Pavel Pudlák, Mario Szegedy, György Turán. jcss, 46(2):129-154, 1993.

1992

On the cardinality of certain Hausdorff spacesJános Gerlits, András Hajnal, Z. Szentmiklóssy. DM, 108(1-3):31-35, 1992. [doi]

1991

Ramsey graphs contain many distinct induced subgraphsNoga Alon, András Hajnal. gc, 7(1):1-6, 1991. [doi]

Local constraints ensuring small representing setsPaul Erdös, András Hajnal, Zsolt Tuza. JCT, 58(1):78-84, 1991. [doi]

1989

On the number of distinct induced subgraphs of a graphPaul Erdös, András Hajnal. DM, 75(1-3):145-154, 1989. [doi]

Ramsey-type theoremsPaul Erdös, András Hajnal. DAM, 25(1-2):37-52, 1989. [doi]

1988

On the Communication Complexity of Graph PropertiesAndrás Hajnal, Wolfgang Maass, György Turán. stoc 1988: 186-191

1987

Some higher-gap examples in combinatorial set theoryAndrás Hajnal, Péter Komjáth. APAL, 33:283-296, 1987. [doi]

Threshold circuits of bounded depthAndrás Hajnal, Wolfgang Maass, Pavel Pudlák, Mario Szegedy, György Turán. focs 1987: 99-110

1986

Coloring graphs with locally few colorsPaul Erdös, Zoltán Füredi, András Hajnal, Péter Komjáth, Vojtech Rödl, Ákos Seress. DM, 59(1-2):21-34, 1986. [doi]

Complete subgraphs of infinite multipartite graphs and antichains in partially ordered setsAndrás Hajnal, N. Sauer. DM, 59(1-2):61-67, 1986. [doi]

1985

Chromatic number of finite and infinite graphs and hypergraphsPaul Erdös, András Hajnal. DM, 53:281-285, 1985. [doi]

The chromatic number of the product of two Alef ::i:: - Chromatic Graphs can be countableAndrás Hajnal. combinatorica, 5(2):137-139, 1985.

1984

What must and what need not be contained in a graph of uncountable chromatic number?András Hajnal, Péter Komjáth. combinatorica, 4(1):47-52, 1984.

1983

More results on Ramsey - Turán Type problemsPaul Erdös, András Hajnal, Vera T. Sós, Endre Szemerédi. combinatorica, 3(1):69-81, 1983.

Paul Erdös is seventyAndrás Hajnal, Vera T. Sós. jgt, 7(4):391-393, 1983. [doi]

1973

A Generalization of the Erdös-Ko-Rado Theorem on Finite Set SystemsAndrás Hajnal, Bruce Rothschild. JCT, 15(3):359-362, 1973.

Sign in or sign up to see more results.

runs on WebDSL