Description
Book SynopsisEvery year there is at least one combinatorics problem in each of the major international mathematical olympiads. These problems can only be solved with a very high level of wit and creativity. This book explains all the problem-solving techniques necessary to tackle these problems, with clear examples from recent contests. It also includes a large problem section for each topic, including hints and full solutions so that the reader can practice the material covered in the book. The material will be useful not only to participants in the olympiads and their coaches but also in university courses on combinatorics.
Trade ReviewFrom the reviews:
“Soberón (Univ. College London, UK) presents tools, techniques, and some tricks to tackle problems of varying difficulty in combinatorial mathematics in this well-written book. … Salient features include the wealth of examples, exercises, and problems and two additional chapters with hints and solutions to the problems. Valuable for all readers interested in combinatorics and useful as a course resource on the subject. Summing Up: Highly recommended. Upper-division undergraduate through professional mathematics collections.” (D. V. Chopra, Choice, Vol. 51 (4), December, 2013)
Table of ContentsIntroduction.- 1 First concepts.- 2 The pigeonhole principle.- 3 Invariants.- 4 Graph theory.- 5 Functions.- 6 Generating Functions.- 7 Partitions.- 8 Hints for the problems.- 9 Solutions to the problems.- Notation.- Further reading.- Index.
