Organizer

Martin Milanič (University of Primorska)

Co-Organizer

Viktor Zamaraev (University of Liverpool)

Description

Being the intersection of graph theory and computer science, Algorithmic Graph Theory is the study of graph-theoretical problems from a computational perspective. The goal of this minisymposium is to present the spectrum of current research in the area, highlighting relevant open problems and possible techniques for solving them. The topics of interest include (but are not limited to): structural graph theory, graph classes, width parameters, algorithmic metatheorems, parameterized complexity, and approximation algorithms.

For more information about the minisymposium, please see the minisymposium web site.

Organizer

Bojan Kuzma (University of Primorska)

Co-Organizer

Damjana Kokol Bukovšek (University of Ljubljana)

Description

Graphs, finite or infinite, can be fruitfully applied in studying the inner structure of (semi)groups, rings, and algebras in various branches of mathematics, including (Linear)Algebra and Functional Analysis. The aim is to present recently obtained results in diverse areas where graphs yielded new insights (or were used as a tool to either prove or describe them).

Organizer

Jae-Ho Lee (University of North Florida)

Co-Organizers

Paul Terwilliger (University of Wisconsin - Madison)
Štefko Miklavič (University of Primorska)

Description

An association scheme is a combinatorial object that generalizes both a finite group and a distance-regular graph. There are a number of algebras related to association schemes, such as the Bose-Mesner algebra, dual Bose-Mesner algebra, subconstituent algebra, q-Onsager algebra, and Askey-Wilson algebra. Our mini-symposium is about association schemes from both a combinatorial and algebraic point of view.

For more information about the minisymposium, please see the minisymposium web site.

Organizer

Nino Bašić (University of Primorska)

Description

Chemical graph theory investigates various applications of graph theory to chemistry. For example, a molecule can be modeled as a graph, where vertices represent atoms and edges represent chemical bonds. Benzenoids and fullerenes are two well known examples of such graph classes. Combinatorial properties of these graphs (such as perfect matchings) and graph spectra can be used to model characteristics of molecules, from stability and reactivity to electronic structure. This minisymposium will cover cutting-edge results in the area. The topics of interest of the minisymposium include: topological indices, enumeration of graphs classes, graphs with importance for biosciences, phylogenetics and synthetic biology, etc.

A special sub-theme concerns the class of nut graphs as a special tribute to Prof. Irene Sciriha (University of Malta), a pioneer in this area. These graphs have emerging applications in chemistry and molecular physics.

Proceedings of this minisymposium will be published in the new platinum open access journal Discrete Mathematical Chemistry, after peer review. Contributions to this special issue from non-participants will also be welcome.

Organizer

Anita Pasotti (University of Brescia)

Co-Organizer

Tommaso Traetta (University of Brescia)

Description

Combinatorial Design theory is a rich branch of Combinatorics that deals with the existence and construction of discrete structures having some special balance or symmetry properties, whose studies have produced and have been influenced by innovative applications. This minisymposium is devoted to all topics related to Combinatorial Designs and their applications with the scope of bringing together experts of different scientific backgrounds and seniority to discuss the latest achievements as well as new directions of future research.

Organizer

Gábor Gévay (University of Szeged)

Description

In spite of being objects of discrete mathematics, with particularly simple definition, configurations occur in many different areas of research, such as algebraic geometry, incidence geometry, matroids, dessins d'enfants on Riemann surfaces, even application of finite geometry in theoretical physics, just to mention some of them. On the combinatorial side, they are closely related to graph theory which provide useful tools for studying them, considering especially their symmetry properties. The goal of this minisymposium is to exchange ideas, to provoke fruitful discussions, hence motivating and inspiring new results, possibly even to open new directions of research.

Organizer

Théo Pierron (LIRIS, Université Claude Bernard Lyon 1)

Co-Organizer

Jonathan Narboni (Jagiellonian University)

Description

Graph coloring is a well-established field in combinatorics that aims to understand how the structure of a graph affects its chromatic parameters. To answer these questions, a wide range of mathematical techniques from various branches, including combinatorics, probabilities, topology, and automated proofs, are employed. The purpose of this symposium is to examine the most recent developments in this field, exploring current trends and methods used to solve graph coloring problems.

Organizer

Michael Henning (University of Johannesburg, South Africa)

Co-Organizer

Csilla Bujtas (University of Ljubljana)

Description

Graph domination has experienced rapid growth over the past few decades. The purpose of this minisymposium is to bring together researchers working on various aspects of graph domination, including topics in domination in graphs, structures of domination in graphs, and domination algorithms. The goal of this minisymposium is to examine recent developments in graph domination, exploring current trends and methods used to solve graph domination problems and presenting open problems in the field.

Organizer

Ismael Yero (Cadiz University)

Description

The metric dimension of graphs is a classical topic in graph theory which had its birth by the middle of the 20th century. Since then, a lot of significant studies on this direction have appeared. They cover a very wide range of contributions that include both theoretical and applied investigations. Nowadays, the metric dimension of graphs is very well studied, although one can still find a large number of open problems that are of interest for the research community. Moreover, the existence of numerous variations of the classical concept enriches much more the theory.

In this sense, our mini-symposium is aimed to create a perfect space for researchers dedicated to study the metric dimension of graphs, or any of its related variants, in order to favor the collaboration on this research area.

Organizer

Tony Huynh (Sapienza University of Rome)

Co-Organizer

Paul Wollan (Sapienza University of Rome)

Description

Structural graph theory seeks to understand the global structure of a graph.  For example, the celebrated Graph Minors Structure Theorem of Robertson and Seymour describes the rough structure of graphs without a fixed minor. Topics include (but are not limited to) graph minors, induced subgraphs, other containment relationships (such as immersions), digraph structure, connectivity, width parameters (such as treewidth and twinwidth), and graph product structure theory.

For more information about the minisymposium, please see the minisymposium web site.

Organizer

Isabel Hubard (National Autonomus University of Mexico)

Co-Organizer

Primož Šparl (University of Ljubljana)

Description

The purpose of this minisymposium is to bring together researchers working on various aspects of symmetries of graphs and/or all kinds of discrete structures related to graphs such as maps, hypermaps, polytopes, configurations, etc. The main focus is on contributions presenting results and/or interesting problems concerning symmetries of discrete structures, where combinatorics meets algebra and in particular group theory, but we also welcome related contributions.