{"product_id":"graph-theory-and-additive-combinatorics-exploring-structure-and-randomness-9781009310949","title":"Graph Theory and Additive Combinatorics: Exploring Structure and Randomness","description":"\u003cp\u003e\u003c\/p\u003e\u003cblockquote\u003eThis 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. \u003c\/blockquote\u003e\u003cp\u003e\u003cstrong\u003eFormat\u003c\/strong\u003e: Hardback\u003cbr\u003e\u003cstrong\u003eLength\u003c\/strong\u003e: 338 pages\u003cbr\u003e\u003cstrong\u003ePublication date\u003c\/strong\u003e: 31 July 2023\u003cbr\u003e\u003cstrong\u003ePublisher\u003c\/strong\u003e: Cambridge University Press\u003cbr\u003e\u003c\/p\u003e \u003cp\u003e\u003cbr\u003eThis 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.\u003cbr\u003e\u003cbr\u003eThe 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.\u003cbr\u003e\u003cbr\u003eImportant 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.\u003cbr\u003e\u003cbr\u003eDesigned 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.\u003c\/p\u003e\u003cp\u003e\u003cstrong\u003eWeight\u003c\/strong\u003e: 766g\u003cbr\u003e\u003cstrong\u003eDimension\u003c\/strong\u003e: 183 x 260 x 24 (mm)\u003cbr\u003e\u003cstrong\u003eISBN-13\u003c\/strong\u003e: 9781009310949\u003c\/p\u003e","brand":"YufeiZhao","offers":[{"title":"Hardback","offer_id":44515828728058,"sku":"9781009310949","price":52.35,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0522\/4297\/2845\/products\/1692376375686_book.jpg?v=1692885076","url":"https:\/\/shulphink.com\/products\/graph-theory-and-additive-combinatorics-exploring-structure-and-randomness-9781009310949","provider":"Shulph Ink","version":"1.0","type":"link"}