Buy Now, Pay Later
- – 6-month term
- – No impact on credit to apply
- – Instant approval decision
- – Secure and straightforward checkout
Ready to go? Add this product to your cart and select a plan during checkout.
Payment plans are offered through our trusted finance partners Klarna, Affirm, Afterpay, Apple Pay, and PayTomorrow. No-credit-needed leasing options through Acima may also be available at checkout.
Learn more about financing & leasing here.
FREE 30-day refund/replacement
To qualify for a full refund, items must be returned in their original, unused condition. If an item is returned in a used, damaged, or materially different state, you may be granted a partial refund.
To initiate a return, please visit our Returns Center.
View our full returns policy here.
Description
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. Read more
Publisher : Cambridge University Press
Publication date : August 31, 2023
Edition : 1st
Language : English
Print length : 338 pages
ISBN-10 : 1009310941
ISBN-13 : 49
Item Weight : 1.68 pounds
Dimensions : 7.01 x 0.94 x 10 inches
Best Sellers Rank: #1,712,985 in Books (See Top 100 in Books) #118 in Graph Theory (Books) #244 in Discrete Mathematics (Books) #5,390 in Mathematics (Books)
Frequently asked questions
To initiate a return, please visit our Returns Center.
View our full returns policy here.
- Klarna Financing
- Affirm Pay in 4
- Affirm Financing
- Afterpay Financing
- PayTomorrow Financing
- Financing through Apple Pay
Learn more about financing & leasing here.
