Yufei Zhao (Massachusetts Institute of Technology)

Graph Theory and Additive Combinatorics

Exploring Structure and Randomness

• Gebundenes Buch

Produktbeschreibung

This graduate level textbook covers classical and modern developments in graph theory and additive combinatorics, presenting arguments as a cohesive whole. Students will appreciate the chapter summaries, many figures and exercises, as well as the complementary set of lecture videos freely available through MIT OpenCourseWare.

---

Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.

Produktdetails

• Verlag: Cambridge University Press
• Seitenzahl: 338
• Erscheinungstermin: 31. August 2023
• Englisch
• Abmessung: 254mm x 183mm x 23mm
• Gewicht: 806g
• ISBN-13: 9781009310949
• ISBN-10: 1009310941
• Artikelnr.: 67289075

Autorenporträt

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.

Inhaltsangabe

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.