Graph Theory and Additive Combinatorics (Hardcover)

Yufei Zhao

ISBN 10: 1009310941 / ISBN 13: 9781009310949

Published by Cambridge University Press, Cambridge, 2023

About this Item

Hardcover. Using the dichotomy of structure and pseudorandomness as a central theme, this accessible text provides a modern introduction to extremal graph theory and additive combinatorics. Readers will explore central results in additive combinatorics-notably the cornerstone theorems of Roth, Szemeredi, Freiman, and Green-Tao-and will gain additional insights into these ideas through graph theoretic perspectives. Topics discussed include the Turan problem, Szemeredi's graph regularity method, pseudorandom graphs, graph limits, graph homomorphism inequalities, Fourier analysis in additive combinatorics, the structure of set addition, and the sum-product problem. Important combinatorial, graph theoretic, analytic, Fourier, algebraic, and geometric methods are highlighted. Students will appreciate the chapter summaries, many figures and exercises, and freely available lecture videos on MIT OpenCourseWare. Meant as an introduction for students and researchers studying combinatorics, theoretical computer science, analysis, probability, and number theory, the text assumes only basic familiarity with abstract algebra, analysis, and linear algebra. 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. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.

Seller Inventory # 9781009310949

Bibliographic Details

• Title: Graph Theory and Additive Combinatorics (Hardcover)
• Publisher: Cambridge University Press, Cambridge
• Publication Date: 2023
• Language: English
• ISBN 10: 1009310941
• ISBN 13: 9781009310949
• Binding: Hardcover
• Condition: new

About this title

Synopsis

An introductory text covering classical and modern developments in graph theory and additive combinatorics, based on Zhao's MIT course.

About the Author

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.