000			01626cam a22003258i 4500
001			23087665
003			OSt
005			20240509145439.0
008			230429s2023 enk b 001 0 eng
010			_a 2023011809
020			_a9781009310949 _q(hardback)
020			_z9781009310956 _q(ebook)
040			_aLBSOR _beng _erda _cIISERB _dDLC
042			_apcc
050	0	0	_aQA166 _b.Z54 2023
082	0	0	_a511.5 Z61G _223/eng/20230605
100	1		_aZhao, Yufei. _930092
245	1	0	_aGraph theory and additive combinatorics : _bexploring structure and randomness _cYufei Zhao.
260			_aCambridge: _bCambridge University Press, _c2023.
263			_a2306
300			_axvii, 316p.
504			_aIncludes bibliographical references and index.
505	0		_aAppetizer : 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.
520			_a"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"--
650		0	_aGraph theory. _930093
650		0	_aAdditive combinatorics. _930094
906			_a7 _bcbc _corignew _d1 _eecip _f20 _gy-gencatlg
942			_2ddc _cBK
999			_c10271 _d10271