2023-12-18 15:00 — 16:00 FAMNIT-MP1 Safet Penjić (University of Primorska, Slovenia) On combinatorial structure and algebraic characterizations of distance-regular digraphs Let \G=\G(A) denote a simple strongly connected digraph with vertex set X, diameter D, and let \{A_0,A:=A_1,A_2,\ldots,A_D\} denote the set…
2023-12-11 15:00 — 16:00 Famnit MP1 Jean-Florent Raymond, CNRS, LIMOS, France Induced paths in sparse graphs Every induced path is a path, but the converse is not true. However in some classes of graphs (such as, for instance, planar graphs), the existence…
2023-11-20 14:00 — 15:00 FAMNIT-MP1 Nina Chiarelli (UP FAMNIT) Extendability of certain product graphs A graph G of even order is k-extendable if it has at least 2k+2 vertices, contains a matching of size k, and if every k-matching is…
2023-11-07 14:00 — 15:00 Zoom Blas Fernández (University of Primorska, Slovenia) Terwilliger algebras beyond distance-regular graphs: a combinatorial approach The Terwilliger algebra $T$ has been extensively studied in the context of distance-regular graphs, which have only a few irreducible $T$-modules…
2023-11-06 15:00 — 16:00 FAMNIT-MP1 Sebastian Wiederrecht (DIMAG, IBS, Daejeon, Korea) Structural Parametrizations of the Maximum Independent Set Problem Excluding a graph (or a family of graphs) under a fixed containment relation can yield graph classes with very particular properties.…
2023-10-16 15:00 — 16:00 Famnit MP1 Robin Wilson (Open University, United Kingdom) Combinatorics – The Mathematics that Counts In this partly historical talk I explain what is meant by combinatorics, and outline its development from ancient problems in China and India…
2023-10-19 15:00 — 16:00 Famnit MP1 Maël DUMAS (University of Orléans, France) On graphs coverable with k shortest paths We show that if the edges or vertices of an undirected graph G can be covered by k shortest paths, then…
2023-10-12 10:00-17:30 FAMNIT-MP1 Various invited speakers Workshop on Algebraic Combinatorics We’re thrilled to extend an invitation to you for a workshop that’s bound to be an eye-opener. Hosted by the Andrej Marušič Institute and the Faculty of Mathematics, Natural Sciences,…
2023-10-02 15:00 — 16:00 Famnit MP1 Claire Hilaire (UP FAMNIT, Slovenia) Minor-Universal Graph for Graphs on Surfaces We show that, for every $n$ and every surface $\Sigma$ (orientable or not), there is a graph $U$ embeddable on $\Sigma$ with at most…