03556cam a2200373 i 450000100090000000300080000900500170001700800410003401000170007502000290009204000370012104200080015805000210016608200190018708400230020610000320022924500560026125000120031726400320032926400110036130000340037233600210040633700250042733800230045236500140047549000640048950400500055352022050060365000180280877601780282694200120300499900190301695201470303517690074BD-DhUL20171119122527.0130409s2013    njua     b    001 0 eng    a  2013002850  a9781118637531 (hardback)  aDLCbengcDLCerdadDLCdBD-DhUL  apcc00aQA164b.E74 201300a511.6bERI223  aMAT0080002bisacsh1 aErickson, Martin J.,d1963-10aIntroduction to combinatorics /cMartin J. Erickson  a2nd ed. 1aNew Jersey :bWiley,c2013. 4cİ2013  axii, 232 p. :bill. ;c24 cm.  atext2rdacontent  aunmediated2rdamedia  avolume2rdacarrier  b100.95c$0 aWiley series in discrete mathematics and optimization ;v78  aIncludes bibliographical references and index  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. 0aCombinatorics08iOnline version:aErickson, Martin J., 1963-tIntroduction to combinatoricsbSecond [edition].dHoboken, New Jersey : John Wiley & Sons, 2013z9781118640210w(DLC) 2013015019  2ddccBK  c214435d214435  00102ddc406511_600000000000000_ERI708NFIC9355488aDULbDULcGENd2017-09-27ePurchasedo511.6 ERIp503952r2017-09-27t1w2017-09-27yBK