Welcome!

Everyone with an interest in combinatorics and its applications is warmly invited to the 5th Scottish Combinatorics Meeting, to be held in the International Centre for Mathematical Sciences at the University of Edinburgh.

The invited speakers are:

• Julia Böttcher (London School of Economics) Spanning subgraphs of randomly perturbed graphs
• Stephen Finbow (St Francis Xavier University, Canada) The Firefighter problem on graphs
• Daniela Kühn (University of Birmingham) The Oberwolfach problem
• Gary McGuire (University College Dublin) The Number of Roots of a Linearized Polynomial
• Kurt Melhorn (MPI, University of Saarbrucken) The Complexity of a Variant of Mastermind
• Guus Regts (University of Amsterdam) On the location of zeros of the independence polynomial of bounded degree graphs
• Nik Ruskuc (University of St Andrews) Decidability of the WQO problem for permutations under the consecutive pattern involvement

In addition to the invited talks, a number of research students and junior researchers (including junior faculty) will give presentations on their work.

There is a pdf file containing all the abstracts here.

Attendance at the meeting is FREE, but participants are asked to register by late March (by emailing the organiser) in order to help with catering arrangements. Tea, coffee and light lunch will be provided on both days.

Dinner has been arranged at Howies on Waterloo Place for 7:15pm on the evening of Thursday 25th. If you would like to participate please let us know (preferably at time of registration), this will be at your own cost.

The meeting will be held at ICMS, on the top floor of the new Bayes Center at the University of Edinburgh. Information on how to get to the venue can be found here.

We look forward to welcoming you to Edinburgh.

Mary and team