×

Programme

Minisymposia

In addition to the talks in the general session, the conference will host a number of special minisymposia. A minisymposium will consist of at least 9 contributed talks and at least one invited talk. Currently confirmed minisymposia are listed below.

When submitting an abstract please select an option whether you wish to submit it to the general session or to a specific minisymposium.

Organizers

Marko Orel (University of Primorska)
Polona Oblak (University of Ljubljana)

Description

Algebraic and spectral aspects of combinatorics bridge discrete structures with powerful linear algebra and abstract algebra frameworks. Here, matrix eigenvalues and related parameters are of particular importance. Expected themes include, but are not limited to, the following topics:
-Graphs and linear algebra
-Graphs with special algebraic or combinatorial properties
-Graphs derived from mathematical structures over finite fields/rings/semirings etc.
-Spectral graph theory
-Inverse eigenvalue problems
-Graph homomorphisms/automorphisms and related preserver problems
-Zero forcing
-Spectral properties of sign patterns
-Coding theory and combinatorics

Organizers

Viktor Zamaraev (University of Liverpool)
Martin Milanič (University of Primorska)

Description

At the intersection of graph theory and computer science, Algorithmic Graph Theory studies graph-theoretical problems from a computational perspective. This minisymposium aims to showcase the breadth of current research in the area, highlighting important open problems and promising approaches to solving them. Topics of interest include, but are not limited to, structural graph theory, graph classes, width parameters, algorithmic metatheorems, parameterized complexity, and approximation algorithms.

Organizers

Safet Penjić (University of Primorska)
Blas Fernandez (University of Primorska)

Description

Association schemes provide a powerful framework connecting algebra, combinatorics, and graph theory. This minisymposium will bring together researchers working on association schemes and closely related structures, including distance-regular (strongly regular) graphs, (P/Q)-polynomial schemes, Terwilliger algebras, coherent configurations, spectral methods, and algebraic aspects of combinatorial structures such as distance-biregular graphs and Delsarte-type design theory.
 
The aim is to present recent developments, new constructions, structural and classification results, and emerging connections between algebraic and combinatorial techniques. The minisymposium will also provide a forum for discussing open problems and promising directions in algebraic combinatorics.

Organizers

Jan Goedgebeur (KU Leuven)
Jorik Jooken (Leiden University)

Description

Computers are often used in combinatorics to tackle problems about combinatorial objects with given structural or extremal properties, especially when these problems are too complex to solve by hand. Computational approaches can include the design and implementation of algorithms for generating combinatorial objects from a given class (typically avoiding the generation of isomorphic copies), systematic searches for examples or counterexamples and joint theoretical and computer-assisted approaches.

In this minisymposium we present some recent examples where computational methods have been successfully used to help solve problems in graph theory. The emphasis is on the design and implementation of computational methods as tools for obtaining mathematical results and insight, rather than on the complexity analysis of the algorithms themselves.

Organizer

Ismael G. Yero (Universidad de Cádiz)

Description

This minisymposium aims to explore several graph invariants defined via shortest-path distances, highlighting structural insights and computational challenges across network topology and graph theory. On the one hand, it focuses on metric dimension parameters, including classical metric dimension, fault-tolerant variants, multiset dimension, and edge dimension, among others. Discussions will cover characterizations, sharp bounds, and complexity analysis for distinguishing vertex sets using geodesic distance properties. On the other hand, the session features emerging research on visibility parameters, such as the mutual-visibility number and the general position number, along with their variations. These topics explore sets of vertices that "see" each other via unblocked geodesics, bridging concepts between computer science applications and classical combinatorial problems. By bringing together structural bounds, product graph characterizations, and algorithmic complexity contributions, this minisymposium aims to gather researchers with common interests in graph theoretical studies on these and related parameters.

Organizer

Michael A. Henning (University of Johannesburg)

Description

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

Organizers

Michel Lavrauw (University of Primorska)
Simeon Ball (Universitat Politècnica de Catalunya)
Giusy Monzillo (University of Primorska)
George Savvaoudis (University of Primorska)

Description

The minisymposium Finite Geometry and Coding Theory (FGCT) is part of the 11th Slovenian Conference on Graph Theory , which will take place in Bled, Slovenia, from 20 to 26 June 2027.
 
The aim of the minisymposium is to bring together researchers working in finite geometry, coding theory, and related areas of combinatorics. Geometric methods play a central role in the construction and analysis of codes, while questions from coding theory continue to motivate new developments in finite geometry.
 
Topics include finite projective and affine spaces, incidence geometry, blocking sets, arcs and caps, linear sets, scattered spaces, rank-metric codes, subspace codes, algebraic and combinatorial coding theory, and related topics.
 

Organizer

Zdeněk Dvořák (Charles University Prague)

Description

Last few years brought a number of new topics in structural graph theory (asymptotic dimension, coarse graph theory, ...) as well as breakthrough results on classical topics (polynomial bounds on the minor structure theorem).  The minisymposium will survey these topics as well as other contemporary trends in this area.

Organizers

Marston Conder (University of Auckland and University of Primorska)
Ademir Hujdurović (University of Primorska)

Description

This minisymposium will explore symmetry in graphs, maps, and other combinatorial structures, emphasizing connections between graph theory, group theory, and combinatorics. Topics include automorphism groups, vertex-, edge-, and arc-transitive graphs, Cayley graphs, maps and their symmetries, regular and semiregular group actions, and related highly symmetric structures.

View
Programme