In memory of László Kalmár | 0 | 0.34 | 2007 |
Polarized Partition Relations | 1 | 0.41 | 2001 |
Turán-Ramsey Theorems and Kp-Independence Numbers | 0 | 0.34 | 1994 |
Threshold circuits of bounded depth | 146 | 9.90 | 1993 |
Turán-Ramsey theorems and simple asymptotically extremal structures | 4 | 0.53 | 1993 |
Local constraints ensuring small representing sets | 3 | 0.89 | 1991 |
On the communication complexity of graph properties | 27 | 3.91 | 1988 |
The chromatic number of the product of two Alef i - Chromatic Graphs can be countable | 5 | 1.46 | 1985 |
What must and what need not be contained in a graph of uncountable chromatic number? | 6 | 1.48 | 1984 |
More results on Ramsey - Turán Type problems | 16 | 5.17 | 1983 |