×

Paul Erdős, 1913-1996. (English) Zbl 0884.01034

MSC:

01A70 Biographies, obituaries, personalia, bibliographies
01A60 History of mathematics in the 20th century

Keywords:

Obituary

Biographic References:

Erdős, P.
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Alon, N.; Spencer, J., The Probabilistic Method (1992), New York: Wiley, New York · Zbl 0767.05001
[2] Babai, L.,In and out of Hungary, Paul Erdős, his friends and times. In:Combinatorics, Paul Erdős is 80, Vol. 2 (Eds. Miklós, Sós, Szőnyi). Bolyai Soc. Math. Stud. 2, Budapest, 1996, 7-96. · Zbl 0849.01024
[3] Bollobás, B., Extremal Graph Theory (1978), London: Academic Press, London · Zbl 0419.05031
[4] Bollobás, B., Random Graph Theory (1985), London: Academic Press, London
[5] Bollobás, B.; Graham; Nešetrřil, Paul Erdős—Life and work, The Mathematics of P. Erdős, 1-41 (1997), Berlin: Springer, Berlin · Zbl 0864.01007
[6] Dvoretzky, A.; Erdős, P.; Kakutani, S., Multiple points of paths of Brownian motion in the plane, Bull. Res. Council Israel, 3, 364-371 (1954)
[7] Edelsbrunner, H., Algorithms in Combinatorial Geometry (1987), Berlin: Springer, Berlin · Zbl 0634.52001
[8] Elliott, P. D. T., Probabilistic Number Theory (1980), New York: Springer, New York · Zbl 0431.10030
[9] Erdélyi, T., Szabados J. andVértesi, P., to appear in J. Approx. Theory.
[10] Erdős, P., On the difference of consecutive primes, Quart. J. Math. Oxford Ser., 6, 124-128 (1935) · JFM 61.0134.03
[11] Erdős, P., On a new method in elementary number theory which leads to an elementary proof of the prime number theorem, Proc. Nat. Acad. Sci., 35, 374-384 (1949) · Zbl 0034.31403
[12] Erdős, P., An interpolation problem associated with the continuum hypothesis, Michigan Math. J., 11, 9-10 (1964) · Zbl 0121.25801
[13] Erdős, P., On the law of the iterated logarithm, Ann. of Math., 43, 419-436 (1942) · Zbl 0063.01264
[14] Erdős, P., On sets of distances of n points, Amer. Math. Monthly, 53, 248-250 (1946) · Zbl 0060.34805
[15] Erdős, P.; Capocelli, R., Some applications of probability methods to number theory, Successes and limitations, Sequences (Naples/Positano, 1988), 182-194 (1990), New York: Springer, New York · Zbl 0697.10002
[16] Erdős, P.,On some of my favourite theorems. In:Combinatorics, Paul Erdős is 80, Vol. 2 (Eds. Miklós, Sós, Szőnyi), Bolyai Soc. Math. Stud. 2, Budapest, 1996, 97-132. · Zbl 0853.11001
[17] Erdős, P.; Graham; Nešetřil, Some of my favorite problems and results, The Mathematics of P. Erdős, 47-67 (1997), Berlin: Springer, Berlin · Zbl 0871.11004
[18] Erdős, P.; Fuchs, W. H. J., On a problem of additive number theory, J. London Math. Soc., 31, 67-73 (1956) · Zbl 0070.04104
[19] Erdős, P.; Grünwald, T., On polynomials with only real roots, Ann. of Math., 40, 537-548 (1939) · JFM 65.0056.03
[20] Erdős, P.; Hajnal, A.; Máté, A.; Rado, R., Combinatorial Set Theory: Partition Relations for Cardinals (1984), Amsterdam-New York: North-Holland Publishing Co., Amsterdam-New York · Zbl 0573.03019
[21] Erdős, P.; Ko, C.; Rado, R., Intersection theorems for systems of finite sets, Quart. J. Math. Oxford Ser., 12, 313-320 (1961) · Zbl 0100.01902
[22] Erdős, P.; Rado, R., A partition calculus in set theory, Bull. Amer. Math. Soc., 62, 427-489 (1956) · Zbl 0071.05105
[23] Erdős, P.; Rado, R., Intersection theorems for systems of sets, J. London Math. Soc., 35, 85-90 (1960) · Zbl 0103.27901
[24] Erdős, P.; Rényi, A., On the evolution of random graphs, Magyar-Tud.-Akad.-Mat.-Int-Közl., 5, 17-61 (1960) · Zbl 0103.16301
[25] Erdős, P.; Purdy, G.; Graham; Lovász; Grötschel, Extremal problems in Combinatorial Geometry, Handbook of Combinatorics (1995), Amsterdam: Elsevier Sci. B.V., Amsterdam · Zbl 0852.52009
[26] Erdős, P.; Simonovits, M., A limit theorem in graph theory, Studia Sci. Math. Hungar., 1, 51-57 (1966) · Zbl 0178.27301
[27] Erdős, P.; Spencer, J., Probabilistic methods in combinatorics (1984), New York: Academic Press, New York
[28] Erdős, P.; Stone, H., On the structure of linear graphs, Bull. Amer. Math. Soc., 52, 1087-1091 (1946) · Zbl 0063.01277
[29] Erdős, P.; Szalay, M.; Györy, K.; Halász, G., On some problems of the statistical theory of partitions, Number Theory (1990), Amsterdam: North-Holland, Amsterdam
[30] Erdős, P.; Szekes, M., A combinational problem in geometry, Compositio Math., 2, 463-470 (1935) · Zbl 0012.27010
[31] Erdős, P.; Turán, P., On interpolation, I. Quadrature and mean convergence in the Lagrange interpolation, Ann. of Math., 38, 142-155 (1937) · JFM 63.0233.03
[32] Erdős, P.; Turán, P., On a problem of Sidon in additive number theory and on some related problems, J. London Math. Soc., 16, 212-215 (1941) · Zbl 0061.07301
[33] Erdős, P.; Turán, P., On a problem in the theory of uniform distribution, I-II, Proc. Kon. Nederl. Akad. Wetensch., 51, 370-413 (1948)
[34] Erdős, P.; Turán, P., On some new questions on the distribution of prime numbers, Bull. Amer. Math. Soc., 54, 271-278 (1948)
[35] Erdős, P.; Turán, P., On some problems of a statistical group theory, VII. Collection of articles dedicated to the memory of A. Rényi, I, Period. Math. Hungar., 2, 149-163 (1972) · Zbl 0247.20008
[36] Graham, R. L., to appear in Combinatorica.
[37] Hadwiger, H.; Debrunner, H.; Klee, V., Combinatorial geometry in the plane (1964), New York: Holt, Reinhart and Winston, New York
[38] Hajnal, A.; Graham; Nešetřil, Paul Erdős’s set theory, The Mathematics of Paul Erdős, 352-393 (1997), Berlin: Springer, Berlin · Zbl 0865.01010
[39] Halberstam, H.; Roth, K. F., Sequences (1966), Oxford: Clarendon Press, Oxford · Zbl 0141.04405
[40] Karonski, M. andRuczinski, A.,The origins of the theory of random graphs I. In:The Mathematics of Paul Erdős, Vol. II (Eds. Graham and Nešetřil), Algorithms and Combinatorics 13. Springer Verlag (1997), 311-336. · Zbl 0881.05115
[41] Losonczi, L., Paul Erdős on functional equations: Contributions and impact, Aequationes Math., 54, 221-233 (1997) · Zbl 0885.01023
[42] Pach, J.; Agarval, P., Combinatorial Geometry (1995), New York: Wiley, New York · Zbl 0881.52001
[43] Pomerance, K.; Sárközy, A.; Graham; Lovász; Grötschel, Combinatorial Number Theory, Handbooks of Combinatorics (1995), Amsterdam: Elsevier Sci. B. V., Amsterdam · Zbl 0849.11001
[44] Ruzsa, I. Z., to appear in J. of Number Theory.
[45] Sárközy, A., to appear in Acta Arithmetica.
[46] Schinzel, A.; Graham; Nešetřil, Arithmetical properties of polynomials, The Mathematics of Paul Erdős, 151-154 (1997), Berlin: Springer, Berlin · Zbl 0868.11041
[47] Selberg, A., An elementary proof of prime number theorem, Ann. of Math., 50, 305-313 (1949) · Zbl 0036.30604
[48] Simonovits, M.; Beineke; Wilson, Extremal Graph Theory, Selected Topics in Graph Theory, 161-200 (1983), London, New York, San Francisco: Academic Press, London, New York, San Francisco · Zbl 0531.05037
[49] Simonovits, M.; Graham; Nešetřil, Paul Erdős’ influence on extremal graph theory, The Mathematics of Paul Erdős, 148-192 (1997), Berlin: Springer, Berlin · Zbl 0863.05045
[50] Turán, P., Paul Erdős is 50, Matematikai Lapok, 14, 1-28 (1963) · Zbl 0113.00208
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.