Problem-Solving Methods in Combinatorics

Problem-Solving Methods in Combinatorics : An Approach to Olympiad Problems

By (author) 

Free delivery worldwide

Available. Dispatched from the UK in 2 business days
When will my order arrive?

Description

Every 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.show more

Product details

  • Paperback | 183 pages
  • 166 x 230 x 12mm | 320g
  • Springer Basel
  • Switzerland
  • English
  • 2013 ed.
  • 55 black & white illustrations, 10 colour illustrations, biography
  • 3034805969
  • 9783034805964
  • 1,288,574

Back cover copy

Every year there is at least one combinatorics problem in each of the major international mathematical olympiads. These problems can only be solvedwith a very high level of wit and creativity. This book explains all the problem-solving techniques necessary to tacklethese problems, with clear examples from recent contests.It also includesa 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."show more

Review quote

From the reviews: "Soberon (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)show more

About Pablo Soberón

Pablo Soberon (born 1988) is the first Mexican to obtain a gold medal in the International Mathematical Olympiad. After participating in mathematical olympiads, he has also trained Mexican teams for various international mathematical contests. He currently does research in discrete geometry at University College London and enjoys olympiad problem-solving in his free time.show more

Table of contents

Introduction.- 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.show more

Review Text

From 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)§show more