Introduction to Combinatorics

, by
Introduction to Combinatorics by Erickson, Martin J., 9781118637531
Note: Supplemental materials are not guaranteed with Rental or Used book purchases.
  • ISBN: 9781118637531 | 1118637534
  • Cover: Hardcover
  • Copyright: 4/8/2013

  • Rent

    (Recommended)

    $83.99
     
    Term
    Due
    Price
    *This item is part of an exclusive publisher rental program and requires an additional convenience fee. This fee will be reflected in the shopping cart.
  • Buy New

    Currently Available, Usually Ships in 24-48 Hours

    $120.78

This book provides an introduction to the main concepts of combinatorics, features fundamental results, discusses interconnection and problem-solving techniques, and collects and disseminates open problems that raise questions and observations.is the ideal text for advanced undergraduate and early graduate courses in this subject. The Second Edition contains over fifty new examples that illustrate important combinatorial concepts and range from the routine (i.e. special kinds of sets, functions, and sequences) to the advanced (i.e. the SET game, the Gitterpunktproblem, and enumeration of partial orders). The tables and references are been updated throughout, reflecting advances in Ramsey numbers and Thomas Hales' solution of Kepler's conjecture). In addition, many exciting new computer programs and exercises have been incorporated to help readers understand and apply combinatorial techniques and ideas. The author has now made it possible for readers to encode and execute programs for formulas that were previously inaccessible, allowing for a deeper, investigative study of combinatorics. Each of the book's three sections, Existence, Enumeration, and Construction, begin with a simply stated first principle, which is then developed step-by-step until it leads to one of the three major achievements of combinatorics: Van der Waerden's theorem on arithmetic progressions, Polya's graph enumeration formula, and Leech's 24-dimensional lattice. Many important combinatorial methods are revisited and repeated several times throughout the book in exercises, examples, theorems, and proofs alike, enabling readers to build confidence and reinforce their understanding of complex material.
Loading Icon

Please wait while the item is added to your bag...
Continue Shopping Button
Checkout Button
Loading Icon
Continue Shopping Button