![]() Ideal for both classroom teaching and self-study, this text requires only a modest amount of mathematical background. This edition also contains more than 450 exercises. It includes seven new chapters that cover occupancy problems, Stirling and Catalan numbers, graph theory, trees, Dirichlet’s pigeonhole principle, Ramsey theory, and rook polynomials. This second edition incorporates 50 percent more material. Although the authors present most of the topics through concrete problems, they also emphasize the importance of proofs in mathematics. The authors take an easily accessible approach that introduces problems before leading into the theory involved. Completely revised, How to Count: An Introduction to Combinatorics, Second Edition shows how to solve numerous classic and other interesting combinatorial problems. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. Archives
June 2023
Categories |