/Exposé en anglais/Talk in english/

We consider an edge version of the famous (and hard) degree-diameter problem, where one is wondering about the maximum size of a graph given maximum degree and diameter of the line graph. This problem originated from 1988 and was proposed by Erdos and Nesetril. It was the inspiration for a series of research papers on variants of this problem. We will start discussing part of the history, which is related with e.g. the (still widely open) strong edge colouring conjecture. In the second part of the talk, we will look again to the initial inspirational question and the ideas behind some progress on this.

[Stijn Cambie ] ( Radboud University, Nimègue )

https://www.math.ru.nl/~stijncambie/

Remarques / Remarks

Find all the information of the working group on the web page [ https://graphesetoptimisation.labri.fr/pmwiki.php/Groupe/GT?userlang=en ] https://graphesetoptimisation.labri.fr/pmwiki.php/Groupe/GT?userlang=en

Retrouvez toutes les informations du GT sur [ https://graphesetoptimisation.labri.fr/pmwiki.php/Groupe/GT ] https://graphesetoptimisation.labri.fr/pmwiki.php/Groupe/GT