000			03397cam a2200361 i 4500
001			17690074
003			BD-DhUL
005			20171119122527.0
008			130409s2013 njua b 001 0 eng
010			_a 2013002850
020			_a9781118637531 (hardback)
040			_aDLC _beng _cDLC _erda _dDLC _dBD-DhUL
042			_apcc
050	0	0	_aQA164 _b.E74 2013
082	0	0	_a511.6 _bERI _223
084			_aMAT008000 _2bisacsh
100	1		_aErickson, Martin J., _d1963-
245	1	0	_aIntroduction to combinatorics / _cMartin J. Erickson
250			_a2nd ed.
264		1	_aNew Jersey : _bWiley, _c2013.
264		4	_c©2013
300			_axii, 232 p. : _bill. ; _c24 cm.
336			_atext _2rdacontent
337			_aunmediated _2rdamedia
338			_avolume _2rdacarrier
365			_b100.95 _c$
490	0		_aWiley series in discrete mathematics and optimization ; _v78
504			_aIncludes bibliographical references and index
520			_a"Praise for the First Edition--"This excellent text should prove a useful accoutrement for any developing mathematics program. it's short, it's sweet, it's beautifully written." --The Mathematical Intelligencer"Erickson has prepared an exemplary work. strongly recommended for inclusion in undergraduate-level library collections." --ChoiceFeaturing a modern approach, Introduction to Combinatorics, Second Edition illustrates the applicability of combinatorial methods and discusses topics that are not typically addressed in literature, such as Alcuin's sequence, Rook paths, and Leech's lattice. The book also presents fundamental results, discusses interconnection and problem-solving techniques, and collects and disseminates open problems that raise questions and observations.Many important combinatorial methods are revisited and repeated several times throughout the book in exercises, examples, theorems, and proofs alike, allowing readers to build confidence and reinforce their understanding of complex material. In addition, the author successfully guides readers step-by-step through three major achievements of combinatorics: Van der Waerden's theorem on arithmetic progressions, Polya's graph enumeration formula, and Leech's 24-dimensional lattice. Along with updated tables and references that reflect recent advances in various areas, such as error-correcting codes and combinatorial designs, the Second Edition also features: Many new exercises to help readers understand and apply combinatorial techniques and ideas A deeper, investigative study of combinatorics through exercises requiring the use of computer programs Over fifty new examples, ranging in level from routine to advanced, that illustrate important combinatorial concepts Basic principles and theories in combinatorics as well as new and innovative results in the field Introduction to Combinatorics, Second Edition is an ideal textbook for a one- or two-semester sequence in combinatorics, graph theory, and discrete mathematics at the upper-undergraduate level. The book is also an excellent reference for anyone interested in the various applications of elementary combinatorics"-- _cProvided by publisher.
650		0	_aCombinatorics
776	0	8	_iOnline version: _aErickson, Martin J., 1963- _tIntroduction to combinatorics _bSecond [edition]. _dHoboken, New Jersey : John Wiley & Sons, 2013 _z9781118640210 _w(DLC) 2013015019
942			_2ddc _cBK
999			_c214435 _d214435