YufeiZhao
Graph Theory and Additive Combinatorics: Exploring Structure and Randomness
Graph Theory and Additive Combinatorics: Exploring Structure and Randomness
💎 Earn 261 Points (£2.61) on this item.
YOU SAVE £2.64
- Condition: Brand new
- UK Delivery times: Usually arrives within 2 - 3 working days
- UK Shipping: Fee starts at £2.39. Subject to product weight & dimension
Bulk ordering. Want 15 or more copies? Get a personalised quote and bigger discounts. Learn more about bulk orders.
Couldn't load pickup availability
- More about Graph Theory and Additive Combinatorics: Exploring Structure and Randomness
This book provides a modern introduction to extremal graph theory and additive combinatorics, exploring central results through graph theoretic perspectives and highlighting important methods. It is intended for students and researchers in combinatorics, theoretical computer science, analysis, probability, and number theory.
Format: Hardback
Length: 338 pages
Publication date: 31 July 2023
Publisher: Cambridge University Press
This comprehensive text delves into the realm of extremal graph theory and additive combinatorics, employing the dichotomy of structure and pseudorandomness as a central theme. It offers a modern introduction to these subjects, making them accessible to readers with a basic understanding of abstract algebra, analysis, and linear algebra.
The book begins by exploring fundamental concepts in additive combinatorics, including the cornerstone theorems of Roth, Szemerédi, Freiman, and Green-Tao. Through graph theoretic perspectives, readers gain deeper insights into these ideas, while also exploring topics such as 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 throughout the text, providing students with a solid foundation for further study in these fields. Chapter summaries, numerous figures, and exercises aid in comprehension, while freely available lecture videos on MIT OpenCourseWare further enhance the learning experience.
Designed as an introduction for students and researchers pursuing combinatorics, theoretical computer science, analysis, probability, and number theory, this text assumes only a basic familiarity with abstract algebra, analysis, and linear algebra. It serves as a valuable resource for those seeking to delve into the world of extremal graph theory and additive combinatorics.
Weight: 766g
Dimension: 183 x 260 x 24 (mm)
ISBN-13: 9781009310949
This item can be found in:
UK and International shipping information
UK and International shipping information
UK Delivery and returns information:
- Delivery within 2 - 3 days when ordering in the UK.
- Shipping fee for UK customers from £2.39. Fully tracked shipping service available.
- Returns policy: Return within 30 days of receipt for full refund.
International deliveries:
Shulph Ink now ships to Australia, Belgium, Canada, France, Germany, Ireland, Italy, India, Luxembourg Saudi Arabia, Singapore, Spain, Netherlands, New Zealand, United Arab Emirates, United States of America.
- Delivery times: within 5 - 10 days for international orders.
- Shipping fee: charges vary for overseas orders. Only tracked services are available for most international orders. Some countries have untracked shipping options.
- Customs charges: If ordering to addresses outside the United Kingdom, you may or may not incur additional customs and duties fees during local delivery.
