Combinatorics and graph theory (Q4950461)

This book for undergraduate mathematics students covers the following three central fields: Graph theory, Combinatorics, Infinite combinatorics and graphs. Chapter 1 focuses on the theory of finite graphs: trees, planarity, colouring, matchings, and Ramsey theory. Chapter 2 develops the central techniques of enumerative combinatorics: the principle of inclusion and exclusion, the theory and application of generating functions, the solution of recurrence relations, Pólya's theory of counting arrangements in the presence of symmetry, and important classes of numbers, including the Fibonacci, Catalan, Stirling, Bell, and Euler numbers. Chapter 3 presents infinite pigeonhole principles: König's lemma and Ramsey's theorem. This chapter gives an excellent invitation to combinatorial set theory. The text contains fully worked out examples, exercises at the end of each subchapter, hints and references for further study.