Skip to content

Booksellers & Trade Customers: Sign up for online bulk buying at trade.atlanticbooks.com for wholesale discounts

Booksellers: Create Account on our B2B Portal for wholesale discounts

Graph Theory and Additive Combinatorics: Exploring Structure and Randomness

by Yufei Zhao
Save 5% Save 5%
Current price ₹6,819.00
Original price ₹7,177.00
Original price ₹7,177.00
Original price ₹7,177.00
(-5%)
₹6,819.00
Current price ₹6,819.00

Ships in 1-2 Days

Free Shipping in India on orders above Rs. 500

Request Bulk Quantity Quote
+91
Book cover type: Hardcover
  • ISBN13: 9781009310949
  • Binding: Hardcover
  • Subject: N/A
  • Publisher: Cambridge University Press
  • Publisher Imprint: Cambridge University Press
  • Publication Date:
  • Pages: 338
  • Original Price: GBP 54.99
  • Language: English
  • Edition: N/A
  • Item Weight: 798 grams
  • BISAC Subject(s): Discrete Mathematics and Graphic Methods

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, Szemerédi, Freiman, and Green-Tao-and will gain additional insights into these ideas through graph theoretic perspectives. Topics discussed include the Turán problem, Szemerédi'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.

Zhao, Yufei: - 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.

Trusted for over 49 years

Family Owned Company

Secure Payment

All Major Credit Cards/Debit Cards/UPI & More Accepted

New & Authentic Products

India's Largest Distributor

Need Support?

Whatsapp Us