【学术讲座】尼斯大学Julien Bensmail副教授-- On the "quest" towards a directed variant of the 1-2-3 Conjecture
报告题目：On the "quest" towards a directed variant of the 1-2-3 Conjecture
摘要:The 1-2-3 Conjecture, posed in 2004 by Karoński, Łuczak and Thomason, asks whether the edges of every connected graph different from K2 can be weighted with weights 1,2,3 so that no two adjacent vertices are incident to the same sum of incident weights. Since its introduction, this conjecture has been attracting more and more attention. In particular, several works have been dedicated to verifying the 1-2-3 Conjecture for various classes of graphs, proving modified forms of the conjecture, and investigating some interesting aspects such as algorithmic ones.
In graph theory, one legitimate direction for research regarding an undirected graph problem is to wonder about possible generalisations to digraphs. In the recent years, several attempts have hence been made for bringing the 1-2-3 Conjecture to digraphs. The goal of this talk will be to survey most of these attempts. In particular, we will stress out why things have been rather disappointing so far, and why the "quest" towards a directed 1-2-3 Conjecture might be not over yet.
报告人简介：Julien Bensmail，博士毕业于法国波尔多计算机研究实验室，现为法国尼斯大学副教授。主要从事图论研究工作，在图的划分与分解，及图论问题算法方面做出了许多研究成果。在Combinatorica、Discrete Mathematics、Journal of Graph Theory等图论期刊发表学术论文30余篇。