Combinatorics, Paul Erdős is eighty. Vol. 1 (Q1311473): Difference between revisions

The articles of this volume will be reviewed individually. Indexed articles: \textit{Lovász, László}, Paul Erdős is 80, 9-11 [Zbl 0789.01020] \textit{Sperner, Joel}, For the class of '68, 13-14 [Zbl 0793.01023] \textit{Szekeres, George}, Recollections, 15-17 [Zbl 0793.01015] \textit{Ajtai, M.}, Geometric properties of sets defined by constant depth circuits, 19-31 [Zbl 0799.68083] \textit{Alon, N.; Dubiner, M.}, Zero-sum sets of prescribed size, 33-50 [Zbl 0823.11006] \textit{Beck, J.}, Achievement games and the probabilistic method, 51-78 [Zbl 0806.90146] \textit{Bollobás, Béla; Jin, G.}, A partition problem of Erdős for integers, 79-89 [Zbl 0795.05007] \textit{Burosch, G.; Demetrovics, J.; Katona, G. O. H.; Kleitman, D. J.; Sapozhenko, A. A.}, On the number of closure operations, 91-105 [Zbl 0794.05003] \textit{Deuber, W. A.}, Canonization, 107-123 [Zbl 0789.05089] \textit{Faudree, R. J.}, Some strong variations of connectivity, 125-144 [Zbl 0791.05067] \textit{Felsner, S.; Trotter, W. T.}, Balancing pairs in partially ordered sets, 145-157 [Zbl 0798.06005] \textit{Füredi, Z.; Kleitman, D. J.}, The minimal number of zero sums, 159-172 [Zbl 0795.05014] \textit{Godsil, C. D.}, Equitable partitions, 173-192 [Zbl 0795.05011] \textit{Guy, R. K.; Nowakowski, R. J.}, Mousetrap, 193-206 [Zbl 0794.05002] \textit{Gyárfás, A.; Király, Z.; Lehel, J.}, On-line graph coloring and finite basis problems, 207-214 [Zbl 0791.05041] \textit{Häggkvist, R.; Hellgren, T.}, Extensions of edge-colourings in hypergraphs. I, 215-238 [Zbl 0795.05053] \textit{Hajnal, András; Juhász, István; Szentmiklóssy, Zoltán}, Compact CCC spaces of prescribed density via hypergraphs, 239-252 [Zbl 0795.54006] \textit{Ivanov, A. A.}, Constructing the Monster via its \(Y\)-presentation, 253-269 [Zbl 0812.20003] \textit{Komjáth, P.}, A note on large chromatic systems of finite sets, 271-275 [Zbl 0792.04003] \textit{Milner, E. C.; Pouzet, M.}, A decomposition theorem for closure systems having no infinite independent set, 277-299 [Zbl 0795.04004] \textit{Nisan, N.}, The communication complexity of threshold gates, 301-315 [Zbl 0790.94028] \textit{Rödl, Vojtěch; Ruciński, Andrzej}, Lower bounds on probability thresholds for Ramsey properties, 317-346 [Zbl 0790.05078] \textit{Sachs, H.}, Elementary proof of the cycle-plus-triangles theorem, 347-359 [Zbl 0797.05047] \textit{Sauer, N.}, Vertex partition problems, 361-377 [Zbl 0795.05104] \textit{Schrijver, A.}, Applying free partially commutative groups to paths and circuits in directed graphs on surfaces, 379-401 [Zbl 0798.05028] \textit{Shelah, Saharon}, The universality spectrum: Consistency for more classes, 403-420 [Zbl 0805.03020] \textit{Spencer, J.}, The Janson inequality, 421-432 [Zbl 0792.05131] \textit{Tetali, P.; Winkler, P.}, Simultaneous reversible Markov chains, 433-451 [Zbl 0791.60055] \textit{Wigderson, A.}, The fusion method for lower bounds in circuit complexity, 453-468 [Zbl 0799.68082] List of publications of Paul Erdős, 471-527 [Zbl 0789.01021]