Combinatorics

There is a combinatorial theory graduate seminar on most Tuesdays during term at 1400hrs. Links to the full series listing and the next talk are below: 

Combinatorial Theory Seminar 

Alex Scott is the organiser of the seminar.

Oxford Discrete Mathematics and Probability Seminar (ODMAP)

ODMAP has been running since March 2020 online, and there are usually two seminars each term. The meetings are organised by Christina Goldschmidt and Alex Scott. Details of the talks, how to join the mailing list, as well as past talk listings, can be found on the ODMAP website. Watch previous seminars on YouTube.

Junior combinatorics seminar

An occasional series running during term time.

One-Day Meeting in Combinatorics

The annual One-Day Meeting in Combinatorics runs every year in May or June. If you have any questions about the event, please contact Alex Scott.

The 2025 event will be held in the Mathematical Institute, University of Oxford on Tuesday 27 May 2025. (View the programme here and details of previous meetings can be found here).

Graduate Course - Trinity Term 2025

Finding Structure in Expander Graphs - Dr Nemanja Draganic C2 1100 starting 9 May 

Expanders are a remarkable class of graphs—sparse yet highly connected, they arise in combinatorics, computer science, and beyond. Examples include random graphs and Cayley graphs of certain groups, which play a key role in understanding connectivity, randomness, and the structure of large networks. But what kinds of structures can we actually find in these graphs? Can we guarantee large independent sets and matchings, Hamiltonian cycles, or specific spanning trees? Exploring these questions is central to both classical and modern research, with many open problems still unresolved.

This course provides an accessible introduction to modern techniques for analyzing and uncovering structure in expander graphs. With minimal prerequisites, we will develop powerful tools—elegant combinatorial and algorithmic insights, along with probabilistic techniques—some of which are easy to comprehend, yet deeply insightful, having shaped recent advances in the field. We will also revisit fundamental results through a fresh lens and introduce cutting-edge tools to address open problems, offering a pathway to further exploration.

You can find teaching materials here.

Prerequisites: Basic probability and graph theory. For more details and to sign up, contact Nemanja Draganic.

Useful Links

The group is based at the Mathematical Institute, University of Oxford. Instructions on how to reach the Institute can be found here.

Information about vacancies at the Oxford University Mathematical Institute can be found here.

If you are interested in undertaking graduate studies with us, please see the department's information for prospective graduate students.