Scientific programme

Plenary speakers

  • Michael Giudici (The University of Western Australia, Perth, Australia)
  • Michael Henning (University of Johannesburg, South Africa)
  • Brendan D. McKay (Australian National University, Canberra, Australia)
  • Alexander Mednykh (Sobolev Institute of Mathematics, Novosibirsk, Russia)
  • Joy Morris (University of Lethbridge, Canada)
  • Gábor Tardos (Hungarian Academy of Sciences, Budapest, Hungary)
  • Carsten Thomassen (Technical University of Denmark, Lyngby, Denmark)
  • Thomas Tucker (Colgate University, Hamilton, USA)
  • Douglas West (Zhejiang Normal University, Jinhua, China, and University of Illinois, USA)

The minisymposia

Together with the general sessions talks, the conference will host a number of special minisymposia. When submitting an abstract please select an option whether you wish to have it in a general session or in a specific minisymposium. The list of the minisymposia with their organizers and descriptions is:

  • Applications of Groups in Graph Theory
    • Organizer: Christopher Parker (University of Birmingham, UK), c.w.parker@bham.ac.uk
    • Description: The aim of the section is bringing together researchers in graph symmetry with people who are primarily group theorists but also interested in the application of group theoretical results to graph theory. We see this as an opportunity to discuss certain graph theoretical problems that are intractable by purely combinatorial means and seem to require involvement of group theory.
  • Association Schemes
    • Organizer: Ilya Ponomarenko (Saint Petersburg Department of V. A. Steklov Institute of Mathematics, Russia), inp@pdmi.ras.ru
    • Description: In the frame of the minisymposia, we are planning to discuss some recent results in association schemes and related topics: coherent configurations, Schur rings, table algebras... The list of participants includes leading researches working on these topics.
  • Chemical Graph Theory
    • Organizer: Xueliang Li (Nankai University, Tianjin, China), lxl@nankai.edu.cn
    • Description: The aim of this section is to bring together people working in chemical graph theory. The topics include spectra of graphs and related subjects, molecular descriptors or graph invariants with application in chemistry, graph polynomials and matrices, matching theory, etc. This section is in cooperation with the satellite event "11th Meeting of the International Academy of Mathematical Chemistry".
  • Combinatorics
    • Organizer: Matjaž Konvalinka (University of Ljubljana, Slovenia), matjaz.konvalinka@fmf.uni-lj.si
    • Description: This minisymposium aims to bring together researchers working in enumerative, algebraic, and extremal combinatorics, to show their results, present open problems, and to discuss the applications of combinatorics in other fields.
  • Finite Geometry
    • Organizer: Tamás Szőnyi (Eötvös Loránd University, Budapest, Hungary), szonyi@cs.elte.hu
    • Description: The minisymposium is mainly devoted to interesting substructures of finite geometric structures. Special attention will be paid to connections with problems related to graphs and hypergraphs, in particular extremal problems for graphs and hypergraphs and also for substructures.
  • Graph Domination
    • Organizer: Paul Dorbec (Université de Bordeaux, LaBRI, France), paul.dorbec@labri.fr
    • Description: This symposium is devoted to recent results on domination in graphs and some recent related parameters. Many recent results on the topic deserve close interest, especially in regards of the originality of the techniques involved. This is especially true for some recent related parameters, such as the domination game for example. The symposium will also welcome more classical topics on domination with recent developments.
  • Graph Imbeddings and Map Symmetries
    • Organizer: Jonathan L. Gross (Columbia University, New York, USA), gross@cs.columbia.edu
    • Description: Speakers in this special session will be leading international researchers in a broad selection of principal subareas of topological graph theory. The central theme is the placement of graphs on surfaces, in which there are two complementary perspectives. One may investigate problems regarding the possible placements of a fixed graph, potentially ranging over all surfaces that admit such an embedding, including issues such as the log-concavity of the sequence of numbers of embeddings according to the genus of the surfaces. Alternatively, one may designate a specific surface and study the possible graph embeddings, or maps, in that surface, with particular emphasis on their symmetries. The area is rich in connections to other branches of mathematics and to computer science: algebraic combinatorics, algorithms, computer drawing, finite geometries, group theory, Riemann surfaces, and more.
  • Graph Products
    • Organizer: Richard Hammack (Virginia Commonwealth University, Richmond, USA), rhammack@vcu.edu
    • Description: This minisymposium is a forum for researchers with new results and directions in any area of the theory of graph products, or in areas where products or product-like structures play a role. Products considered may include—but are not limited to—the Cartesian, direct, strong and lexicographic products.
  • Metric Dimension and Related Parameters
    • Organizer: Ismael González Yero (Universidad de Cádiz, Spain), ismael.gonzalez@uca.es
    • Description: This minisymposia is mainly focused on joining researchers from different places in the world sharing a common activity: investigations on metric dimension related structures in graphs, like resolving sets, resolving partitions, identifying codes, locating sets, etc. The minisymposia is also a perfect moment to strengthen some collaborations between the participants to deal with several open problems in this topic, in both theoretical and applied points of view.
  • Polytopes and Graphs
    • Organizer: Egon Schulte (Northeastern University, Boston, USA), e.schulte@neu.edu
    • Description: The mini symposium will provide a much desired opportunity to communicate and share recent developments in polytopes, graphs, and related fields. Possible topics include convex and abstract polytopes, polyhedra and maps, geometric graphs, tessellations, complexes, incidence geometries, configurations, and combinatorial or geometric symmetries.
  • Spectral Graph Theory
    • Organizer: Dragan Stevanović (Serbian Academy of Science and Arts, Belgrade, Serbia and University of Primorska, Koper, Slovenia), dragance106@yahoo.com
    • Description: The minisymposium is meant to serve as a meeting point for researchers working in the theory of graph spectra, both to showcase their latest results and to discuss several open problems.
  • Structure and Properties of Vertex-Transitive Graphs
    • Organizer: Robert Jajcay (Comenius University, Bratislava, Slovakia, and University of Primorska, Koper, Slovenia), robert.jajcay@fmph.uniba.sk
    • Description: Topics for this mini symposium include, but are not limited to, classifications and new constructions for various classes of vertex-transitive graphs; degree, diameter, girth and prohibited subgraphs results, as well as results concerning the automorphism groups of highly symmetric graphs and their embeddings.
  • Vertex Colourings and Forbidden Subgraphs
    • Organizer: Ingo Schiermeyer (Technische Universität Bergakademie Freiberg, Germany), Ingo.Schiermeyer@tu-freiberg.de
    • Description: There is a great variety of results for vertex colourings in graphs in terms of forbidden induced subgraphs. One of the most well-known is the Strong Perfect Graph Theorem. For non-perfect graphs the concept of χ-binding functions for the chromatic number is of increasing interest. Furthermore, several new complexity results for vertex colourings in terms of forbidden induced subgraphs have been shown recently. Main topics in this minisymposium will be vertex colourings, minimum rainbow subgraphs, rainbow connection, computation of ramsey numbers and independent sets.

The minisymposia organizers are also invited speakers.