000			03072nam a22003738i 4500
001			CR9780511666209
003			UkCbUP
005			20200124160334.0
006			m|||||o||d||||||||
007			cr||||||||||||
008			091217s2007||||enk o ||1 0|eng|d
020			_a9780511666209 (ebook)
020			_z9780521698238 (paperback)
040			_aUkCbUP _beng _erda _cUkCbUP
050	0	0	_aQA164 _b.B74 2007
082	0	4	_a511.6 _222
111	2		_aBritish Combinatorial Conference _n(21st : _d2007 : _cReading, England)
245	1	0	_aSurveys in combinatorics 2007 / _cedited by Anthony Hilton, John Talbot.
264		1	_aCambridge : _bCambridge University Press, _c2007.
300			_a1 online resource (vii, 286 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 ; _v346
500			_aTitle from publisher's bibliographic system (viewed on 05 Oct 2015).
505	0		_aHereditary and monotone propertie of combinatorial structures / Béla Bollobás -- Ordering classes of matrices of 0s and 1s / Richard A. Brualdi -- Cycle decompositions of complete graphs / Darryn Bryant -- Excluding induced subgraphs / Maria Chudnovsky and Paul Seymour -- Designs and topology / M.J. Grannell and T.S. Griggs -- The number of points on an algebraic curve over a finite field / J.W.P. Hirschfeld, G. Korchmáros, and F. Torres -- On the efficient approximability of constraint satisfaction problems / Johan H°astad -- The combinatorics of cryptographic key establishment / Keith M. Martin -- Bandwidth of graphic matroids / Frédéric Mazoit and Stéphan Thomassé.
520			_aThis 2007 volume contains survey articles based on the invited lectures given at the Twenty-first British Combinatorial Conference, held in July 2007 at the University of Reading. This biennial conference is a well-established international event and the articles are of the high quality that befits the event. By its nature this volume provides an overview of current research activity in several areas of combinatorics, ranging from graph theory to current applications of combinatorial mathematics, including efficient approximability of NP-hard optimization problems and cryptographic key management. The authors are some of the world's foremost researchers in their fields, and here they summarize existing results, and give a unique preview of work currently being written up. The book provides a valuable survey of the 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		_aHilton, Anthony, _eeditor.
700	1		_aTalbot, J. _q(John), _d1974- _eeditor.
776	0	8	_iPrint version: _z9780521698238
830		0	_aLondon Mathematical Society lecture note series ; _v346.
856	4	0	_uhttps://doi.org/10.1017/CBO9780511666209
999			_c522869 _d522867