MARC details
| 000 -LEADER |
|---|
| fixed length control field |
02033cam a22002538i 4500 |
| 001 - CONTROL NUMBER |
|---|
| control field |
23087665 |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20250609123612.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
230429s2023 enk b 001 0 eng |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9781009310949 |
| 040 ## - CATALOGING SOURCE |
|---|
| Original cataloging agency |
CSL |
| Transcribing agency |
CSL |
| 041 ## - LANGUAGE CODE |
|---|
| Source of code |
eng |
| Language code of text/sound track or separate title |
eng |
| 084 ## - COLON CLASSIFICATION NUMBER |
|---|
| Classification number |
B44 R3 NBHM |
| Assigning agency |
CSL |
| 100 1# - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Zhao, Yufei, |
| Relator term |
author. |
| 9 (RLIN) |
812199 |
| 245 10 - TITLE STATEMENT |
|---|
| Title |
Graph theory and additive combinatorics : |
| Remainder of title |
exploring structure and randomness |
| 264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE |
|---|
| Place of production, publication, distribution, manufacture |
Cambridge ; |
| Name of producer, publisher, distributor, manufacturer |
Cambridge University Press, |
| Date of production, publication, distribution, manufacture, or copyright notice |
2023. |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
xvii, 316 p. |
| Dimensions |
24 cm. |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE |
|---|
| Bibliography, etc. note |
Includes bibliographical references and index. |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc. |
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. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Graph theory. |
| 9 (RLIN) |
812200 |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Discrete Mathematics Information Theory and Coding. |
| 9 (RLIN) |
812201 |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Additive combinatorics. |
| 9 (RLIN) |
812202 |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
, Computational Geometry. |
| 9 (RLIN) |
812203 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Source of classification or shelving scheme |
Colon Classification (CC) |
| Suppress in OPAC |
No |
| Koha item type |
Textual |
| Classification part |
B44 R3 NBHM |
