Erdős magic

The twentieth century saw the elevation of Discrete Mathematics from “the slums of topology” (one of the more polite expressions!) to its current highly regarded position in the mathematical pantheon. Paul Erdős played a key role in this transformation. We call discuss some key results, possibly including:
i) Ramsey Theory. In 1946 Erdős showed that you could two-color the complete graph on $n$ vertices so as to avoid a monochromatic clique of size $k$, where $n$ was exponential in $k$. To do it, he introduced The Probabilistic Method.
ii) Two-Coloring. In 1963 Erdős showed that given any $m = 2 n -1$ sets, each of size n, one could two-color the underlying points so that none of the sets were monochromatic. His proof in two words: Color Randomly! There has been much work on larger $m$. We give a simple algorithm (together with a subtle analysis) of Cherkashin and Kozik that finds a coloring for the best known (so far!) $m$.
iii) Number Theory. In 1940 Erdős , with Marc Kac, showed that the number of prime factors of n satisfies (when appropriately defined) a Gaussian distribution. Amazing!
iv) Liar Games. Paul tries to find an integer from $1$ to $100$ by asking ten Yes/No questions from Carole. BUT, Carole can lie – though at most one time. Can Paul find the number? Or can Carole stop Paul with an Adversary Strategy?
Anecdotes and personal recollections of Paul Erdős will be sprinkled liberally thoughout the presentation.