On 1-2-3 Conjecture
- Speaker
- Xuding Zhu
- Affiliation
- Zhejiang Normal University
- Date
- Time
- – Asia/Shanghai
- Venue
- Online, Zoom
Abstract
The well-known 1-2-3 conjecture asserts that any graph
with no isolated edges has an edge-weighting vertex colouring using
weights 1,2 and 3. The list version of this conjecture asserts that if each
edge $e$ is given a list $L(e)$ of 3 real numbers as permissible weights,
then there is an edge-weighting vertex colouring $f$ using permissible
weights for each edge $e$.
In this talk, I will give a detailed sketch of the proof that if each
edge $e$ is given a list $L(e)$ of 5 permissible weights, then there is an
edge-weighting vertex colouring $f$ using permissible weights from
$L(e)$ for each edge $e$.
Host
Shanghai Center For Mathematical Science
Online Access
Zoom meeting ID: 818 0564 1942 Password: 121323
Link: https://zoom.com.cn/j/81805641942