000			02200nam a22003618i 4500
001			CR9781108332699
003			UkCbUP
005			20200124160346.0
006			m|||||o||d||||||||
007			cr||||||||||||
008			170323s2017||||enk o ||1 0|eng|d
020			_a9781108332699 (ebook)
020			_z9781108413138 (paperback)
040			_aUkCbUP _beng _erda _cUkCbUP
050		4	_aQA164 _b.B74 2017
082	0	4	_a511.6 _223
111	2		_aBritish Combinatorial Conference _n(26th : _d2017 : _cUniversity of Strathclyde)
245	1	0	_aSurveys in combinatorics 2017 / _cedited by Anders Claesson [and four others].
264		1	_aCambridge : _bCambridge University Press, _c2017.
300			_a1 online resource (vii, 442 pages) : _bdigital, PDF file(s).
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
490	1		_aLondon Mathematical Society lecture note series ; _v440
500			_aTitle from publisher's bibliographic system (viewed on 11 Aug 2017).
520			_aThis volume contains nine survey articles which provide expanded accounts of plenary seminars given at the British Combinatorial Conference at the University of Strathclyde in July 2017. This biennial conference is a well-established international event attracting speakers from around the world. Written by internationally recognised experts in the field, these articles represent a timely snapshot of the state of the art in the different areas of combinatorics. Topics covered include the robustness of graph properties, the spt-function of Andrews, switching techniques for edge decompositions of graphs, monotone cellular automata, and applications of relative entropy in additive combinatorics. The book will be useful to researchers and advanced graduate students, primarily in mathematics but also in computer science and statistics.
650		0	_aCombinatorial analysis _vCongresses.
650		0	_aGraph theory _vCongresses.
700	1		_aClaesson, Anders, _eeditor.
776	0	8	_iPrint version: _z9781108413138
830		0	_aLondon Mathematical Society lecture note series ; _v440.
856	4	0	_uhttps://doi.org/10.1017/9781108332699
999			_c523914 _d523912