Graph Theory and Additive Combinatorics

Yufei Zhao is Associate Professor of Mathematics at the Massachusetts Institute of Technology. His research tackles a broad range of problems in discrete mathematics, including extremal, probabilistic, and additive combinatorics, graph theory, and discrete geometry, as well as applications to computer science. His honors include the SIAM Dénes Kőnig prize (2018), the Sloan Research Fellowship (2019), and the NSF CAREER Award (2021). This book is based on an MIT graduate course, which he has taught and developed over the last five years.

• Preface; Notation and Conventions; Appetizer: triangles and equations; 1. Forbidding a subgraph; 2. Graph regularity method; 3. Pseudorandom graphs; 4. Graph limits; 5. Graph homomorphism inequalities; 6. Forbidding 3-term arithmetic progressions; 7. Structure of set addition; 8. Sum-product problem; 9. Progressions in sparse pseudorandom sets; References; Index.

'Yufei Zhao does great mathematics and has an uncanny ability to explain the deepest results with clear understandable prose. For anyone interested in the seminal ideas (and their interrelationships) of recent decades - pseudorandomness, graphons, graph regularity, to name a few - this is the book to read and savor.' Joel Spencer, New York University