Home

A workshop on Algebraic, Topological and Complexity Aspects of Graph Covers will be held in Durham from Monday 9 January to Friday 13 January 2017. The workshop’s main focus is on graph coverings and their applications in different areas of theoretical computer science and mathematics such as models of computation, computational complexity, and algebraic graph theory. The aim of the workshop is to bring together researchers working on these diverse aspects of graph coverings, and to provide an opportunity for them to introduce their approaches and results to one another and to try to pursue joint research. We plan a small number of survey talks, several open problem sessions, and ample time for discussions and problem solving.

Invited Speakers

Pavol Hell, Simon Fraser University, Canada Obstruction Certificates for Geometrically Defined Graph (and Digraph) Classes

Daniel Kráľ, University of Warwick, UK Subgraph Counts in Large Graphs

Edita Máčajová, Comenius University, Bratislava, Slovakia Point-line Configurations and Conjectures in Graph Theory

Past Meetings

Previous workshops in the series were held in:

• Queenstown, New Zealand, 2016 (as part of Symmetries and Covers of Discrete Objects)
• Madeira, Portugal, 2015
• Ostravice, Czech Republic, 2014
• Bovec, Slovenia, 2013
• Eugene, Oregon, 2012
• Kralova Studna, Slovakia, 2011
• Auckland, New Zealand, 2010
• Finse, Norway, 2009

Programme

A detailed schedule is now available.

Registration

Registration is now closed.

Accommodation

Delegates should make their own arrangements for accommodation from the university or using local hotels. We make a number of suggestions and note that it is advisable to book early. A much wider selection can be found at this is durham

• University Accommodation
• The Kingslodge Inn
• Premier Inn, Durham City Centre (please note that there is another Premier Inn in Durham but it is not within easy walking distance of the university).
• Radisson Blu Hotel
• Durham Marriott Hotel Royal County

Travel

Durham is easy to reach by train or air. There are frequent train services to London (about 3 hours) and Edinburgh (about 2 hours). There are two international airports (Newcastle and Durham Tees Valley) with good connections to Durham. They offer cheap flight services to several destinations.

Here is further information on travelling to Durham, and a map for finding your way in the city.

Registered Participants

A photographic record of a subset of those below.

• Thomas Bellitto (University of Bordeaux)
• Jan Bok (Charles University)
• Marston Conder (University of Auckland)
• Konrad Dabrowski (Durham University)
• Jiri Fiala (Charles University)
• Guillaume Fertin (University of Nantes)
• Max Gadouleau (Durham University)
• Pavol Hell (Simon Fraser University)
• Ioannis Ivrissimtzis (Durham University)
• Matthew Johnson (Durham University)
• Jan Karabas (Matej Bel University)
• Pavel Klavik (Charles University)
• Daniel Kral (University of Warwick)
• Jan Kratochvil (Charles University)
• Andrei Krokhin (Durham University)
• Edita Macajova (Comenius University)
• Barnaby Martin (Durham University)
• Tomas Masarik (Charles University)
• George Mertzios (Durham University)
• Iain Moffatt (Royal Holloway University of London)
• Jan Musilek (Charles University)
• Roman Nedela (Slovak Academy of Sciences)
• André Nichterlein (Durham University)
• Daniel Paulusma (Durham University)
• Jozef Siran (Open University)
• Martin Skoviera (Comenius University)
• Iain Stewart (Durham University)
• Stéphane Vialette (Université Paris-Est Marne la Vallée)
• Peter Zeman (Charles University and University of West Bohemia)

Contact: [email protected]

---

Organizing committee:

• Jiri Fiala (Charles University, Prague)
• Matthew Johnson (Durham University)
• Jan Kratochvil (Charles University, Prague)
• Daniel Paulusma (Durham University)
• Jozef Siran (Open University)

We gratefully acknowledge financial support from Durham University and the London Mathematical Society.