Search  for anything...

Graph Theory and Additive Combinatorics: Exploring Structure and Randomness

Based on 14 reviews
Condition: New
Checking for the best price...
$69.98

Buy Now, Pay Later


As low as $11.66 / mo
  • – 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, Zip, Apple Pay, and Google Pay. No-credit-needed leasing options through Acima may also be available at checkout.

Learn more about financing & leasing here.

Free shipping on this product
This item's return window has been extended for the holiday season: FREE refund/replacement until Jan 31, 2027

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.


Availability: In Stock.
Fulfilled by Amazon

Arrives Monday, Nov 16
Order within 15 hours and 21 minutes

Available payment plans shown during checkout

Protect Your Purchase

Easy claims online, fast replacements, no fees

Checking for protection plans...

At a glance

Condition
New
Model
RKC2003145624
Dimensions
7.01 x 0.94 x 10 in
Weight
1.68 lb
Publisher
Cambridge University Press
Publication date
August 31, 2023
Edition
1st

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

Specs 9

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

Frequently asked questions

If you place your order now, the estimated arrival date for this product is: Monday, Nov 16

Yes, absolutely! This item's return window has been extended for the holiday season: FREE refund/replacement until Jan 31, 2027.

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
  • Zip Pay in 4
  • Financing through Apple Pay
  • Financing through Google Pay
Leasing options through Acima may also be available during checkout.

Learn more about financing & leasing here.

Top Amazon Reviews


Difficult
Format: Hardcover
I am only a hobby mathematician, so my comments should read with this mind. The book treats exactly what the title says. I found it difficult to read. The proofs are very terse, I think by spending a few more lines on just about each of them would have helped the understanding. While the prerequisites may not be very much, surely mathematical maturity is assumed by the author. I think a great book for a math professional, but for me it went beyond my limits at times. The print is clear and large, the style may require some getting used to. Theorems are framed, excercises habe big black bar on the side, but after a short time I got used to it. The index is very bad, simply not enough in it. For a first edition, there were not many typos, at least I only found about 20 or so. ... show more
Reviewed in the United States on February 2, 2025 by PST
Checking for best price...