Close this search box.

Home / Textbooks /

Topics in Combinatorics

Topics in Combinatorics



In stock


By Gerry Leversha and Dominic Rowland This is a follow-up to the handbook Introduction to Combinatorics, written by the same two authors, which was published in 2015. The topics covered here require more mathematical preparation than those in the earlier volume, but the style is deliberately discursive, with the explicit aim of exploring how to go about solving challenging problems, rather than just describing the finished solution. The book begins with a number of classical problems including Lucas’s problème des ménages, which counts arrangements of guests around a table, Hall’s marriage theorem, which concerns the effective allocation of resources, and Kirkman’s schoolgirl problem, which was published in a recreational puzzle magazine for Victorian ladies. It then explores major areas of the subject including graph theory, non-partisan games, Pólya enumeration and partitions, finishing with a chapter on Ramsey theory, which can be described as ‘finding order in disorder’. The book concludes with a result which allows readers to prove something which is, in a clearly defined sense, unprovable. There are dozens of carefully chosen exercises and, as before, there are full solutions.

More Textbooks

The Olympiad Bundle


The Junior Bundle


The Intermediate Bundle


Sign up for UKMT News

Receive your quarterly UKMT News, straight to your inbox.

Important Notice: Change in Payment Policy

From 1 September 2024, UKMT will no longer be accepting cheques as a form of payment. This decision comes as part of our ongoing efforts to streamline our processes and improve efficiency.

Thank you for your understanding.

Site maintenance 14.10.23 01:00 – 06:00. Interruptions should be minimal, but please be aware the site may be unavailable during these times for a short period

Site maintenance 14.10.23 01:00 – 06:00. Short interruptions are possible during these times

Welcome to our new site! As we’re using a new system, if you’re a public user you’ll need to re-register.