Independence in graphs

The University of Birmingham has a vibrant and diverse research group in Combinatorics and Graph theory. Indeed, the group has 8 permanent members of staff as well as a number of research fellows and postgraduate students. More details about the group can be found at: http://www.birmingham.ac.uk/research/activity/mathematics/pure-maths/combinatorics.aspx

Many problems in Combinatorics and other areas of Mathematics can be stated in the language of ‘independent sets’ in graphs. Recently, powerful techniques (such as the container method) have been developed in this area, leading to breakthroughs in a diverse range of problems. One such example is the work of the supervisor, together with Balogh, Liu and Sharifzadeh, who gave a solution to a problem of Cameron and Erdős on the number of maximal sum-free subsets of the integers.

The project has scope to go into a number of different directions. Indeed, there could be opportunity to work in problems from both Combinatorial Number theory as well as from Extremal Combinatorics. We welcome applications from talented candidates with a strong background in Graph theory and Combinatorics.

To find out more about studying for a PhD at the University of Birmingham, including full details of the research undertaken in each school, the funding opportunities for each subject, and guidance on making your application, you can now order your copy of the new Doctoral Research Prospectus at: www.birmingham.ac.uk/students/drp.aspx