Graph theory and additive combinatorics : exploring structure and randomness /
Yufei Zhao.
Bok Engelsk 2023
| Omfang | 1 online resource (xvii, 316 pages ): : illustrations (some color.)
|
|---|---|
| Utgave | 1st ed.
|
| Opplysninger | Appetizer : triangles and equations -- Forbidding a subgraph -- Graph regularity method -- Pseudorandom graphs -- Graph limits -- Graph homomorphism inequalities -- Forbidding 3-term arithmetic progressions -- Structure of set addition -- Sum-product problem -- Progressions in sparse pseudorandom sets.. - "This graduate level textbook covers classical and modern developments in graph theory and additive combinatorics, presenting arguments as a cohesive whole. Students will appreciate the chapter summaries, many figures and exercises, as well as the complementary set of lecture videos freely available through MIT OpenCourseWare"--. - 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.
|
| Emner | |
| Dewey | |
| ISBN | 1-009-31095-X. - 9781009310956
|
| ISBN(galt) | 9781009310949 (hardback)
|
