Search the dblp DataBase

Publications of Author

1. András Hajnal, Wolfgang Maass, Pavel Pudlák, Mario Szegedy, György Turán
   Threshold circuits of bounded depth [Citation Graph (0, 0)][DBLP]
   FOCS, 1987, pp:99-110 [Conf]
   
2. András Hajnal, Wolfgang Maass, György Turán
   On the Communication Complexity of Graph Properties [Citation Graph (0, 0)][DBLP]
   STOC, 1988, pp:186-191 [Conf]
   
3. Paul Erdös, András Hajnal, Vera T. Sós, Endre Szemerédi
   More results on Ramsey - Turán Type problems. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1983, v:3, n:1, pp:69-81 [Journal]
   
4. 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. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1993, v:13, n:1, pp:31-56 [Journal]
   
5. András Hajnal
   The chromatic number of the product of two Alef _i - Chromatic Graphs can be countable. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1985, v:5, n:2, pp:137-139 [Journal]
   
6. András Hajnal, Péter Komjáth
   Some Remarks on the Simultaneous Chromatic Number. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 2003, v:23, n:1, pp:89-104 [Journal]
   
7. András Hajnal, Péter Komjáth
   What must and what need not be contained in a graph of uncountable chromatic number?. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1984, v:4, n:1, pp:47-52 [Journal]
   
8. Paul Erdös, András Hajnal, Miklós Simonovits, Vera T. Sós, Endre Szemerédi
   Turán-Ramsey Theorems and K^p-Independence Numbers. [Citation Graph (0, 0)][DBLP]
   Combinatorics, Probability & Computing, 1994, v:3, n:, pp:297-325 [Journal]
   
9. András Hajnal, Wolfgang Maass, Pavel Pudlák, Mario Szegedy, György Turán
   Threshold Circuits of Bounded Depth. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1993, v:46, n:2, pp:129-154 [Journal]
   
10. Paul Erdös, András Hajnal, Zsolt Tuza
    Local constraints ensuring small representing sets. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1991, v:58, n:1, pp:78-84 [Journal]
    
11. András Hajnal, Bruce Rothschild
    A Generalization of the Erdös-Ko-Rado Theorem on Finite Set Systems. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1973, v:15, n:3, pp:359-362 [Journal]
    
12. James E. Baumgartner, András Hajnal
    Polarized Partition Relations. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2001, v:66, n:2, pp:811-821 [Journal]
    
13. Paul Erdös, András Hajnal
    Chromatic number of finite and infinite graphs and hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:53, n:, pp:281-285 [Journal]
    
14. András Hajnal, N. Sauer
    Complete subgraphs of infinite multipartite graphs and antichains in partially ordered sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:59, n:1-2, pp:61-67 [Journal]
    
15. 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. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:59, n:1-2, pp:21-34 [Journal]
    
16. Paul Erdös, András Hajnal
    On the number of distinct induced subgraphs of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:75, n:1-3, pp:145-154 [Journal]
    
17. János Gerlits, András Hajnal, Z. Szentmiklóssy
    On the cardinality of certain Hausdorff spaces. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:108, n:1-3, pp:31-35 [Journal]
    
18. András Hajnal, N. Sauer
    Cut-sets in infinite graphs and partial orders. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:117, n:1-3, pp:113-125 [Journal]
    
19. András Hajnal, Gyula O. H. Katona, Attila Sali
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:1- [Journal]
    
20. 
    In memory of László Kalmár. [Citation Graph (, )][DBLP]
    
    
21. 
    Ramsey-type theorems. [Citation Graph (, )][DBLP]