Dutch-Belgian discrete math seminar



9th Edition at TU/e, The Netherlands      

19 March 2026

We are happy to announce the 8th edition of the Dutch-Belgian seminar in discrete mathematics at Eindhoven University of Technology, on March 19, 2026.

This seminar aims to give young researchers a platform to share their recent results on topics under the umbrella of discrete mathematics. Earlier seminar editions were held at TU/e (3 February 2022, 6 October 2023), VUB (25 May 2022, 31 May 2023, 3 May 2024, 12-13 June 2025), UGent (20 January 2023, 9 December 2024).

The program for this edition is as follows:

 
11:00-11:30 Marta Messia (VUB) On the Etzion and Silberstein conjecture for block Ferrers diagrams  
11:30-12:00 Lara Vicino (RUG) Hierarchical Locally Recoverable Codes on surfaces  
12:00-13:00 LUNCH  
13:00-13:30 Harper Reijnders (TU/e) Improved Gilbert-Varshamov bound for sum-rank-metric codes via graph theory  
13:30-14:00 Lars van der Kuil (Leiden University) The Hat Guessing Number of Graphs 
14:00-14:30 COFFEE BREAK  
14:30-15:00 Jan Meeus (UGent) Tales of Hoffman: from a distance 
15:00-15:30 Philippe Tranchida (ULB) Group operations extended to coset geometries, with applications to abstract regular polytopes 
15:30-16:00 Valentino Smaldore (Universita degli Studi di Padova, Italy) Strongly regular graphs with 2-transitive two-graphs 


The event will take place in building Atlas 2.225 (2nd floor), at the TU/e.

Registration is free but mandatory (for logistic reasons, since lunches will be included) and can be done through the following link: registration form.


The seminar is funded by the Research Foundation Flanders (FWO) and by the Netherlands Organization for Scientific Research (NWO).

Organizers:

Aida Abiad (TU/e, VUB, UGent)

Jan De Beule (VUB)

Sam Mattheus (VUB)




8th Edition at VUB, Belgium      

12-13 June 2025

 
DAY 1: 12 June 2025  
 
10:55-11:00 OPENING  
11:00-12:00 Leo Storme (Ghent University, Belgium) Substructures of Finite Projective Spaces and Finite Classical Polar Spaces  
12:00-13:00 LUNCH  
13:00-14:00 Ferdinando Zullo (Università degli Studi della Campania "Luigi Vanvitelli", Italy) Sidon spaces and quadrics over finite fields  
14:00-15:00 Gianira Alfarano (Rennes University, France) The geometry of one-weight linear codes  
15:00-16:00 BREAK  
16:00-... PhD defense Jonathan Mannaert  
 
DAY 2: 13 June 2025  
 
10:00-10:30 COFFEE  
 
10:30-11:00 Louka Peters (Ghent University, Belgium) Switching graphs and Hadamard matrices  
 
11:00-11:30 Jim Wittebol (VUB, Belgium) Universality of the asymptotic preorder of graphs  
11:30-12:00 Ananth Ravi (TUDelft, Netherlands) Oddtown, Nearly Orthogonal Sets, and Triangle-Free Graphs  
12:00-13:00 LUNCH  
13:00-13:30 Nils van de Berg (TU/e, Netherlands) Counting cospectral graphs made via switching  
13:30-14:00 Fabrizio Conca (TU/e, Netherlands) Connectivity and linear codes 
14:00-14:30 Davide Mattiolo (KULeuven, Belgium) Pairwise disjoint perfect matchings in r-edge-connected r-graphs 
 
14:30-15:00 CLOSING and COFFEE  




7th Edition at Ghent University, Belgium      

9 December 2024

 
11:15-11:30 OPENING  
 
11:30-12:00 Eileen Robinson (ULB, Belgium) Coloring antiprismatic graphs  
12:00-12:30 Thijs van Veluw (UGent-TU/e, Belgium-The Netherlands) Hoffman colorings of graphs  
12:30-13:30 LUNCH  
13:30-14:00 Emiliano Liwski (KULeuven, Belgium) An algorithm to identify the set of minimal matroids  
14:00-14:30 Vlad Taranchuk (UGent, Belgium) Caps, graphs, and polynomials  
14:30-15:00 COFFEE BREAK  
15:00-15:30 Andrea Di Giusto (TU/e, The Netherlands) To Generalized Weights... and Beyond: new invariants for linear codes  
15:30-16:00 Jonathan Mannaert (VUB, Belgium) Boolean degree d functions in the (q-)Johnson scheme  




6th Edition at Vrije Universiteit Brussel (VUB), Belgium      

3 May 2024

 
11:15-11:30 OPENING  
 
11:30-12:00 Carol Zamfirescu (UGent, Belgium) Counting small cycle double covers  
12:00-12:30 Jorik Jooken (KULeuven, Belgium) Computational bounds for the minimum order of an edge-girth-regular graph  
12:30-13:30 LUNCH  
13:30-14:00 Giacomo Masiero (KULeuven, Belgium) On Matroid Varieties and Liftability of Point-Line Configurations  
14:00-14:30 Alexander Van Werde (TU/e, The Netherlands) Cokernel statistics of walk matrices: a random matrix approach towards generalized spectral determinacy of random graphs  
14:30-15:00 COFFEE BREAK  
15:00-15:30 Wout Moltmaker (University of Amsterdam, The Netherlands) Invariants of Planar Knotoids 
15:30-16:00 Sjanne Zeijlemaker (TU/e, The Netherlands) Computing equitable partitions of graphs with a unique tree representation  




5th Edition at Eindhoven University of Technology (TU/e), The Netherlands      

6 October 2023

 
10:45-11:00 OPENING  
 
11:00-12:00 Sam Mattheus (VUB, Belgium) The asymptotics of r(4,t)  
12:00-12:30 Antonina Khramova (TU/e, The Netherlands) On cospectrality in hypergraphs and gain graphs  
12:30-13:30 LUNCH  
13:30-14:00 Tim Seynnaeve (KULeuven, Belgium) Quasihomomorphisms from the integers into Hamming metrics  
14:00-14:30 Vincent Schmeits (UvA, The Netherlands) Perfect state transfer in quantum walks on orientable maps  
14:30-15:00 COFFEE BREAK  
15:00-15:30 Alvaro Samperio (Universidad de Valladolid, Spain) Sparse recovery of an electrical network based on algebraic variety fitting and graph sparsification  
15:30-16:00 Benjamin Jany (TU/e, The Netherlands) Bounds and field size for Locally Recoverable Codes  
16:00-16:30 Stijn Cambie (KULeuven, Belgium) The Erdős distinct subset sums problem in modular setting for small modulus  




4th Edition at Vrije Universiteit Brussel (VUB), Belgium      

31 May 2023

 
10:45-11 OPENING  
 
11-11:30 Ferdinand Ihringer (UGent, Belgium) Strongly regular graphs satisfying the 4-vertex condition  
11:30-12 Maarten de Boeck (Memphis University, U.S.A.) Neumaier graphs  
12-12:30 Altan Kılıç (TU/e, The Netherlands) Codes and Knots  
12:30-13:30 LUNCH  
13:30-14 Sjanne Zeijlemaker (TU/e, The Netherlands) On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme  
14-14:30 Nacho Lopez (University of Lleida, Spain) Measuring the closeness to Moore graphs  
14:30-15 COFFEE BREAK  
15-15:30 Jesus Ceresuela (University of Lleida, Spain) On mixed radial Moore graphs of diameter 3 
15:30-16 Carsten Dietzel (VUB, Belgium) Getting things done with Constraint Programming  

Group photos of previous editions:

missing
1st edition at TU/e, 14 January 2021
missing
1st edition at TU/e, 14 January 2021
missing
3rd edition at UGent, 20 January 2023
missing
4th edition at VUB, 31 May 2023
missing
5th edition at TU/e, 06 October 2023
missing
6th edition at VUB, 03 May 2024
missing
7th edition at UGent, 9 December 2024
missing
8th edition at VUB, 12-13 June 2025
missing
9th edition at TU/e, 19 March 2026


With the support of: