Chapman and Hall/CRC
Accessible to undergraduate students, Introduction to Combinatorics presents approaches for solving counting and structural questions. It looks at how many ways a selection or arrangement can be chosen with a specific set of properties and determines if a selection or arrangement of objects exists that has a particular set of properties.To give stu
Introduction. Fundamentals of Enumeration. The Pigeonhole Principle and Ramsey's Theorem. The Principle of Inclusion and Exclusion. Generating Functions and Recurrence Relations. Catalan, Bell and Stirling Numbers. Symmetries and the Polya-Redfield Method. Introduction to Graph Theory. Further Graph Theory. Coding Theory. Latin Squares. Balanced Incomplete Block Designs. Linear Algebra Methods in Combinatorics. Appendices. Solutions to Set A Exercises. Hints for Problems. Solutions to Problems. References. Index.