000			02829nam a22003498i 4500
001			CR9780511662119
003			UkCbUP
005			20200124160230.0
006			m|||||o||d||||||||
007			cr||||||||||||
008			091215s1997||||enk o ||1 0|eng|d
020			_a9780511662119 (ebook)
020			_z9780521598408 (paperback)
040			_aUkCbUP _beng _erda _cUkCbUP
050	0	4	_aQA164 _b.S883 1997
082	0	0	_a511/.6 _221
245	0	0	_aSurveys in combinatorics, 1997 / _cedited by R.A. Bailey.
264		1	_aCambridge : _bCambridge University Press, _c1997.
300			_a1 online resource (xiii, 338 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 ; _v241
500			_aTitle from publisher's bibliographic system (viewed on 05 Oct 2015).
505	0		_aM₁₃ / J.H. Conway -- The harmonious chromatic number and the achromatic number / Keith Edwards -- Computer construction of block designs / Clement Lam -- Finite quasiprimitive graphs / Cheryl E. Praeger -- Tree width and tangles : a new connectivity measure and some applications / B.A. Reed -- Minor-monotone graph invariants / Alexander Schrijver -- Some applications of algebraic curves in finite geometry and combinatorics / T. Szönyi -- New perspectives on interval orders and interval graphs / William T. Trotter -- Approximate counting / Dominic Welsh.
520			_aThis volume contains the invited lectures given at the Sixteenth British Combinatorial Conference, held in July 1997 at Queen Mary and Westfield College, University of London. This biennial conference is a well-established international event, with speakers from all over the world. Contained here is a survey of some of the most important work ever in graph theory, with related papers that will be essential background reading to anyone doing research in this field. Also included is an illustration of how recent developments in group theory lead to advances in graph theory, and an exciting new construction of one of the Mathieu groups. Other articles show how to construct a block design, and how to use finite geometries. An account is given of the computational complexity of counting. The book provides a valuable survey of the present state of knowledge in combinatorics. It will be useful to research workers and advanced graduate students, primarily in mathematics but also in computer science, statistics and engineering.
650		0	_aCombinatorial analysis _vCongresses.
700	1		_aBailey, R. _q(Rosemary), _eeditor.
776	0	8	_iPrint version: _z9780521598408
830		0	_aLondon Mathematical Society lecture note series ; _v241.
856	4	0	_uhttps://doi.org/10.1017/CBO9780511662119
999			_c517575 _d517573