✳flâneur — a map of the web's best reading

The Discrete Mathematical Charms of Paul Erdos

cambridge.org · 2,409 words · saved by 1 readers

Paul Erdős published more papers during his lifetime than any other mathematician, especially in discrete mathematics. He had a nose for beautiful, simply-stated problems with solutions that have far-reaching consequences across mathematics. This captivating book, written for students, provides an easy-to-understand introduction to discrete mathematics by presenting questions that intrigued Erdős, along with his brilliant ways of working toward their answers. It includes young Erdős's proof of Bertrand's postulate, the Erdős-Szekeres Happy End Theorem, De Bruijn-Erdős theorem, Erdős-Rado delta-systems, Erdős-Ko-Rado theorem, Erdős-Stone theorem, the Erdős-Rényi-Sós Friendship Theorem, Erdős-Rényi random graphs, the Chvátal-Erdős theorem on Hamilton cycles, and other results of Erdős, as well as results related to his work, such as Ramsey's theorem or Deza's theorem on weak delta-systems. Its appendix covers topics normally missing from introductory courses. Filled with personal anecdot

The Discrete Mathematical Charms of Paul Erdos Search Institution Login Search < Back to search results Home Books The Discrete Mathematical Charms of Paul Erdos The Discrete Mathematical Charms of Paul Erdos The Discrete Mathematical Charms of Paul Erdos A Simple Introduction Search within full text Cited by 1 Cited by 1 Crossref Citations This Book has been cited by the following publications. This list is generated based on data provided by Crossref . Dumitrescu, Adrian 2024. The Dirac–Goodman–Pollack Conjecture . Discrete & Computational Geometry, Vol. 72, Issue. 2, p. 728. CrossRef Google

Explore this link on the map →

saved by

related reading