Paul Erdős: Life and Work

Béla Bollobás ()
Additional contact information
Béla Bollobás: University of Cambridge, Department of Pure Mathematics and Mathematical Statistics

A chapter in The Mathematics of Paul Erdős I, 2013, pp 1-41 from Springer

Abstract: Abstract Dipping into the mathematical papers of Paul Erdős is like wandering into Aladdin’s Cave. The beauty, the variety and the sheer wealth of all that one finds is quite overwhelming. There are fundamental papers on number theory, probability theory, real analysis, approximation theory, geometry, set theory and, especially, combinatorics. These great contributions to mathematics span over six decades; Erdős and his collaborators have left an indelible mark on the mathematics of the twentieth-century. The areas of probabilistic number theory, partition calculus for infinite cardinals, extremal combinatorics, and the theory of random graphs have all practically been created by Erdős, and no-one has done more to develop and promote the use of probabilistic methods throughout mathematics.

Keywords: Random Graph; Chromatic Number; Arithmetic Progression; Elementary Proof; Giant Component (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4614-7258-2_1

Ordering information: This item can be ordered from
http://www.springer.com/9781461472582

DOI: 10.1007/978-1-4614-7258-2_1

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().