The mathematics of Paul Erdős. Vol. I (Q2364912)

The articles of this volume will be reviewed individually. Vol. II has been announced in Zbl 0855.00014. Indexed articles: \textit{Bollobás, Béla}, Paul Erdős --- Life and work, 1-41 [Zbl 0864.01007] \textit{Erdős, Paul}, Some of my favorite problems and results, 47-67 [Zbl 0871.11004] \textit{Stone, A. H.}, Encounters with Paul Erdős, 68-73 [Zbl 0877.11003] \textit{Smith, Cedric A. B.}, Did Erdős save western civilization?, 74-85 [Zbl 0867.01015] \textit{Kaplansky, Irving}, Integers uniquely represented by certain ternary forms, 86-94 [Zbl 0867.11028] \textit{Tutte, W. T.}, On cubic graphs of girth at least five, 95-97 [Zbl 0871.05039] \textit{Ahlswede, Rudolf; Khachatrian, Levon H.}, Classical results on primitive and recent results on cross-primitive sequences, 104-116 [Zbl 0882.11009] \textit{Tenenbaum, Gérald}, On the nonderivability of periodic functions associated with certain summation formulas, 117-128 [Zbl 0869.11019] \textit{Sárközy, András; Sós, Vera T.}, On additive representation functions, 129-150 [Zbl 0877.11008] \textit{Schinzel, A.}, Arithmetical properties of polynomials, 151-154 [Zbl 0868.11041] \textit{Ahlswede, Rudolf; Cai, Ning}, Cross-disjoint pairs of clouds in the interval lattice, 155-164 [Zbl 0868.06001] \textit{Bergelson, Vitaly; Erdős, Paul; Hindman, Neil; Łuczak, Tomasz}, Dense difference sets and their combinatorial structure, 165-175 [Zbl 0868.05009] \textit{Konyagin, Sergei; Pomerance, Carl}, On primes recognizable in deterministic polynomial time, 176-198 [Zbl 0869.11102] \textit{Nathanson, Melvyn B.}, Ballot numbers, alternating products, and the Erdös-Heilbronn conjecture, 199-217 [Zbl 0871.05003] \textit{Chung, Fan R. K.; Goldwasser, John L.}, Integer sets containing no solution to \(x+y = 3z\), 218-227 [Zbl 0870.11006] \textit{Nicolas, Jean-Louis}, On Landau's function \(g(n)\), 228-240 [Zbl 0869.11077] \textit{Sárközy, A.}, On divisibility properties of sequences of integers, 241-250 [Zbl 0868.11011] \textit{Shorey, T. N.; Tijdeman, R.}, Some methods of Erdös applied to finite arithmetic progressions, 251-267 [Zbl 0874.11035] \textit{Tenenbaum, Gérald}, 1105: First steps in a mysterious quest, 268-275 [Zbl 0868.11002] \textit{Beck, József}, Games, randomness and algorithms, 280-310 [Zbl 0871.05048] \textit{Karoński, Michał; Ruciński, Andrzej}, The origins of the theory of random graphs, 311-336 [Zbl 0881.05115] \textit{Spencer, Joel}, The Erdös existence argument, 337-344 [Zbl 0867.05061] \textit{Kahn, Jeff}, On some hypergraph problems of Paul Erdös and the asymptotics of matchings, covers and colorings, 345-371 [Zbl 0865.05056] \textit{Pyber, L.}, How abelian is a finite group?, 372-384 [Zbl 0869.20010] \textit{Razborov, Alexander A.}, On small size approximation models, 385-392 [Zbl 0870.68084] \textit{Pudlák, Pavel; Sgall, Jiří}, An upper bound for a communication game related to time-space tradeoffs, 393-399 [Zbl 0868.68086]