Discrete mathematics of Paul Erdős Summer semester 2026

Discrete Mathematics of Paul Erdős -- NDMI107


  • Course description:
    Paul Erdős (1913-- 1996) was an outstanding, prolific, influential, legendary mathematician. We will study a selection of his results in number theory, geometry, Ramsey theory, extremal combinatorial problems, and graph theory that laid the foundations of discrete mathematics before it matured into the rich and vibrant discipline of today. From time to time we will stray from his own work to the work of his confrères and disciples, but we shall never escape the gravitational pull of the great man.

    At a leisurely pace, we shall cover some of the following topics:
    Erdős's proof of Bertrand's postulate. Sylvester-Gallai theorem and De Bruijn-Erdős theorem. Ramsey's theorem and Ramsey numbers. Delta-systems and Deza's proof of an Erdős-Lovász conjecture. Sperner's theorem and the Erdős-Ko-Rado theorem. Extremal set theory. Van der Waerden's theorem and van der Waerden numbers. Erdős's refinement of Turán's theorem. Extremal graph theory. Friendship Theorem. Chromatic number of graphs. The Erdős-Rényi random graphs and their evolution. Hamilton cycles.

            
The subject and the instructor, ca.1976


Top of this page   •   Sources   •   Bulletin board   •   Record of the material covered in class   •   Erdős links

Sources:

Additional reading:


Top of this page   •   Sources   •   Bulletin board   •   Record of the material covered in class   •   Erdős links

Bulletin board


Top of this page   •   Sources   •   Bulletin board   •   Record of the material covered in class   •   Erdős links

Record of the material covered in class

 Date Material covered Homeworks


Top of this page   •   Sources   •   Bulletin board   •   Record of the material covered in class   •   Erdős links


Top of this page   •   Sources   •   Bulletin board   •   Record of the material covered in class   •   Erdős links

Vašek Chvátal's front page at KAM
Vašek Chvátal's front page at Concordia