Counting: The Art of Enumerative Combinatorics

  • George E. Martin

Part of the Undergraduate Texts in Mathematics book series (UTM)

Table of contents

  1. Front Matter
    Pages i-xi
  2. George E. Martin
    Pages 1-26
  3. George E. Martin
    Pages 27-42
  4. George E. Martin
    Pages 43-66
  5. George E. Martin
    Pages 67-84
  6. George E. Martin
    Pages 85-112
  7. George E. Martin
    Pages 113-136
  8. George E. Martin
    Pages 137-151
  9. George E. Martin
    Pages 153-182
  10. Back Matter
    Pages 183-252

About this book


Counting is hard. "Counting" is short for "Enumerative Combinatorics," which certainly doesn't sound easy. This book provides an introduction to discrete mathematics that addresses questions that begin, How many ways are there to... . At the end of the book the reader should be able to answer such nontrivial counting questions as, How many ways are there to stack n poker chips, each of which can be red, white, blue, or green, such that each red chip is adjacent to at least 1 green chip? There are no prerequisites for this course beyond mathematical maturity. The book can be used for a semester course at the sophomore level as introduction to discrete mathematics for mathematics, computer science, and statistics students. The first five chapters can also serve as a basis for a graduate course for in-service teachers.


Computer Counting Enumerative Combinatorics Graph Graph theory computer science statistics

Authors and affiliations

  • George E. Martin
    • 1
  1. 1.Department of Mathematics and StatisticsState University of New York at AlbanyAlbanyUSA

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag New York 2001
  • Publisher Name Springer, New York, NY
  • eBook Packages Springer Book Archive
  • Print ISBN 978-1-4419-2915-0
  • Online ISBN 978-1-4757-4878-9
  • Series Print ISSN 0172-6056
  • Buy this book on publisher's site
Industry Sectors
Finance, Business & Banking